SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
The Assistive Multi-Armed Bandit
16 references·1 citing·38 second hop
The Assistive Multi-Armed Bandit (2019)The Assistive Multi-Armed BanditInformation gathering actions over human internal state (2016)Information gathering actions…Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits (2014)Taming the Monster: A Fast an…Multi‐Armed Bandits, Gittins Index, and its Calculation (2014)Multi‐Armed Bandits, Gittins …Modeling Human Decision Making in Generalized Gaussian Multiarmed Bandits (2014)Modeling Human Decision Makin…Kullback–Leibler upper confidence bounds for optimal sequential allocation (2013)Kullback–Leibler upper confid…KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION (2013)KULLBACK-LEIBLER UPPER CONFID…On Bayesian Upper Confidence Bounds for Bandit Problems (2012)On Bayesian Upper Confidence …Preference Learning (2010)Preference LearningThinking and Deciding (2006)Thinking and DecidingThe Sample Complexity of Exploration in the Multi-Armed Bandit Problem (2004)The Sample Complexity of Expl…Preference Learning in Consecutive Experimental Auctions (2000)Preference Learning in Consec…Sample mean based index policies byO(logn) regret for the multi-armed bandit problem (1995)Sample mean based index polic…Some Aspects of the Sequential Design of Experiments (1985)Some Aspects of the Sequentia…The So-Called Allais Paradox and Rational Decisions under Uncertainty (1979)The So-Called Allais Paradox …Bandit Processes and Dynamic Allocation Indices (1979)Bandit Processes and Dynamic …Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…If We Succeed (2022)If We SucceedA Stochastic Approximation Method (1951)The Nonstochastic Multiarmed Bandit Problem (2002)Using confidence bounds for exploitation-exploration trade-offs (2003)An Empirical Evaluation of Thompson Sampling (2011)Bandits with Knapsacks (2013)Counterfactual Risk Minimization: Learning from Logged Bandit Feedback (2015)Fairness in Learning: Classic and Contextual Bandits (2016)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem (2010)The K-armed dueling bandits problem (2012)Almost Optimal Exploration in Multi-Armed Bandits (2013)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Learning to Optimize via Information-Directed Sampling (2017)Near-Optimal Regret Bounds for Thompson Sampling (2017)Applied Statistical Decision Theory (1962)Applied Statistical Decision Theory. (1962)Restless bandits: activity allocation in a changing world (1988)Legislative leviathan: party government in the House (1993)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)A BEHAVIORAL MODEL OF RATIONAL CHOICE (1955)Risk, Ambiguity, and the Savage Axioms (1961)Rationality of Self and Others in an Economic System (1986)Nontransitive preferences in decision theory (1991)Risk-value models (1993)Theory of games and economic behavior (2019)Behavioral Decision Research: A Constructive Processing Perspective (1992)HARKing: Hypothesizing After the Results are Known (1998)The Role of Goal Orientation in Self-Regulated Learning (2000)Linearly Parameterized Bandits (2010)On Upper-Confidence Bound Policies for Switching Bandit Problems (2011)Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms (2011)Towards affective camera control in games (2010)Preference Learning Using the Choquet Integral: The Case of Multipartite Ranking (2012)Don’t Classify Ratings of Affect; Rank Them! (2014)From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning (2014)Batched bandit problems (2016)Explore First, Exploit Next: The True Shape of Regret in Bandit Problems (2016)
this work references cited by second hop

References

  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 1979Bandit Processes and Dynamic Allocation Indices1,488 cited
  • 2006Thinking and Deciding1,422 cited
  • 1995Sample mean based index policies byO(logn) regret for the multi-armed bandit problem539 cited
  • 2004The Sample Complexity of Exploration in the Multi-Armed Bandit Problem309 cited
  • 2014Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits286 cited
  • 2013KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION274 cited
  • 1979The So-Called Allais Paradox and Rational Decisions under Uncertainty252 cited
  • 2010Preference Learning251 cited
  • 2012On Bayesian Upper Confidence Bounds for Bandit Problems210 cited
  • 2013Kullback–Leibler upper confidence bounds for optimal sequential allocation181 cited
  • 2016Information gathering actions over human internal state160 cited
  • 1985Some Aspects of the Sequential Design of Experiments155 cited
  • 2000Preference Learning in Consecutive Experimental Auctions93 cited
  • 2014Modeling Human Decision Making in Generalized Gaussian Multiarmed Bandits80 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

2014
Multi‐Armed Bandits, Gittins Index, and its Calculation
78 cited

Cited by

  • 2022If We Succeed12 cited