Sciweavers

COLT
2004
Springer

The Budgeted Multi-armed Bandit Problem

13 years 7 months ago
The Budgeted Multi-armed Bandit Problem
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a program given a deadline that only allows a fixed number of runs; or choosing a life partner in the bachelor/bachelorette TV show where time is limited. We are interested in the computational complexity of the coins problem and/or efficient algorithms with approximation guarantees. 1 The Coins Problem We are given:
Omid Madani, Daniel J. Lizotte, Russell Greiner
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2004
Where COLT
Authors Omid Madani, Daniel J. Lizotte, Russell Greiner
Comments (0)