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:

• Type: Conference
• Year: 2004
• Where: COLT
• Authors: Omid Madani, Daniel J. Lizotte, Russell Greiner
• Keywords: Coin, Coin Flip, COLT 2004, Head Probability, Machine Learning