Article View: csd.grad
Article #110[Theory-local] CATS talk, Friday Nov. 7th, 1 pm, AVW 4185 (fwd)
From: Samir Khuller
Date: Wed, 05 Nov 2008 18:55
Date: Wed, 05 Nov 2008 18:55
46 lines
4162 bytes
4162 bytes
Prof. Munagala from Duke will be giving the CATS talk on Fri. samir ---------- Forwarded message ---------- Date: Tue, 4 Nov 2008 18:24:45 -0500 (EST) From: malekian@cs.umd.edu To: theory-local@cs.umd.edu Subject: [Theory-local] CATS talk, Friday Nov. 7th, 1 pm, AVW 4185 Event: CATS talk Date: Nov. 7th Time: 1 pm Location: AVW 4185 Title: LP-duality Based Algorithms for Restless Bandit Problem Speaer: Kamesh Munagala ABSTRACT In numerous areas of operations research and artificial intelligence, we face a problem common to gamblers choosing slot machines (or bandits) in a casino: whether to try new machines or keep playing the one we know and hope for the best. More generally, we face the trade-off between exploration and exploitation: between learning from and adapting to a stochastic system and exploiting our current best-knowledge. A fundamental decision-theoretic model that captures this trade-off is the celebrated Multi-arm Bandit Problem. The basic multi-armed bandit problem admits to an elegant polynomial time solution. However, many stochastic scheduling applications can only be modeled using a generalization termed the Restless Bandit Problem, which in its ultimate generality, is PSPACE-Hard to approximate to any non-trivial factor. In this talk, we derive a 2-approximation algorithm for a general subclass of the Restless Bandit Problem, in which the state-transition probability for each bandit is "separable" into a constant probability matrix and a vector of arbitrary monotone functions of time. The monotonicity models increasing levels of uncertainty as time-since-last-observation increases. We mention applications of this model to wireless scheduling and unmanned aircraft navigation. The resulting algorithm is simple and intuitive, and in addition, applicable to related stochastic scheduling problems. Joint work with Sudipto Guha, UPenn, and Peng Shi, Duke. _______________________________________________ Theory-local mailing list Theory-local@mcfeely.cs.umd.edu https://mailman.cs.umd.edu/mailman/listinfo/theory-local
Technical Details
Message-ID:
<mailman.40.1225911344.3898.gradlist@mcfeely.cs.umd.edu>Path:
arc1-ca.pugleaf.net!g2news2.google.com!news3.google.com!feeder1-2.proxad.net!proxad.net!feeder2-2.proxad.net!npeer.de.kpn-eurorings.net!npeer-ng2.kpn.DE!uio.no!elk.ncren.net!dailyplanet.umd.edu!not-for-mailShow Full Headers
Complete Article Headers
X-Google-Thread: 10f4d5,34618ed7eed300b5,start X-Google-Attributes: gid10f4d5,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Path: arc1-ca.pugleaf.net!g2news2.google.com!news3.google.com!feeder1-2.proxad.net!proxad.net!feeder2-2.proxad.net!npeer.de.kpn-eurorings.net!npeer-ng2.kpn.DE!uio.no!elk.ncren.net!dailyplanet.umd.edu!not-for-mail From: Samir Khuller <samir@cs.umd.edu> Newsgroups: csd.grad Subject: [Theory-local] CATS talk, Friday Nov. 7th, 1 pm, AVW 4185 (fwd) Date: Wed, 5 Nov 2008 13:55:29 -0500 (EST) Organization: University of Maryland College Park Lines: 46 Sender: dept-bounces@cs.umd.edu Message-ID: <mailman.40.1225911344.3898.gradlist@mcfeely.cs.umd.edu> NNTP-Posting-Host: mcfeely.cs.umd.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII; format=flowed X-Trace: dailyplanet.umd.edu 1225911344 10580 128.8.128.218 (5 Nov 2008 18:55:44 GMT) X-Complaints-To: abuse@umd.edu NNTP-Posting-Date: Wed, 5 Nov 2008 18:55:44 +0000 (UTC) To: dept@cs.umd.edu X-CSD-MailScanner-Watermark: 1226516141.37971@kWaKOZOwA1jTYLvvy7JiVg X-CSD-MailScanner-Watermark: 1226516139.77611@Izh9m6SSJtiK5YOwNvovlQ X-CSD-MailScanner-Watermark: 1226516130.06394@5Mug+c/L68/+21IDJGE6GQ X-Greylist: Sender IP whitelisted, not delayed by milter-greylist-4.0 (egg.cs.umd.edu [172.24.3.37]); Wed, 05 Nov 2008 13:55:29 -0500 (EST) X-BeenThere: dept@mcfeely.cs.umd.edu X-Mailman-Version: 2.1.9 Precedence: list Errors-To: dept-bounces@cs.umd.edu X-BeenThere: gradlist@mcfeely.cs.umd.edu List-Id: CS Graduate Students <gradlist.mcfeely.cs.umd.edu> List-Unsubscribe: <https://mailman.cs.umd.edu/mailman/listinfo/gradlist>, <mailto:gradlist-request@mcfeely.cs.umd.edu?subject=unsubscribe> List-Archive: <https://mailman.cs.umd.edu/mailman/private/gradlist> List-Post: <mailto:gradlist@mcfeely.cs.umd.edu> List-Help: <mailto:gradlist-request@mcfeely.cs.umd.edu?subject=help> List-Subscribe: <https://mailman.cs.umd.edu/mailman/listinfo/gradlist>, <mailto:gradlist-request@mcfeely.cs.umd.edu?subject=subscribe>