• Computer Science
  • Published in AAAI 2013

Multi-Armed Bandit with Budget Constraint and Variable Costs

@inproceedings{Ding2013MultiArmedBW,
  title={Multi-Armed Bandit with Budget Constraint and Variable Costs},
  author={Wenkui Ding and Tao Qin and Xu-Dong Zhang and Tie-Yan Liu},
  booktitle={AAAI},
  year={2013}
}
We study the multi-armed bandit problems with budget constraint and variable costs (MAB-BV). In this setting, pulling an arm will receive a random reward together with a random cost, and the objective of an algorithm is to pull a sequence of arms in order to maximize the expected total reward with the costs of pulling those arms complying with a budget constraint. This new setting models many Internet applications (e.g., ad exchange, sponsored search, and cloud computing) in a more accurate… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 59 CITATIONS

Thompson Sampling for Budgeted Multi-Armed Bandits

VIEW 15 EXCERPTS
CITES RESULTS, METHODS & BACKGROUND

FILTER CITATIONS BY YEAR

2014
2019

CITATION STATISTICS

  • 7 Highly Influenced Citations

  • Averaged 11 Citations per year from 2017 through 2019