Research graph
References from Introduction to Multi-Armed Bandits. Local targets link to admitted publications; unresolved targets remain external evidence.
Unresolved reference
2011 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
2005 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
External reference
Unresolved reference
External reference
Unresolved reference
2012 · External reference
Unresolved reference
2014 · External reference
Unresolved reference
2017 · External reference
Competition and Innovation: An Inverted U Relationship
2005 · External reference
The continuum-armed bandit problem
10.1137/s0363012992237273 · 1995 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2014 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2013 · External reference
A Dynamic Near-Optimal Algorithm for Online Linear Programming
10.1287/opre.2014.1289 · 2014 · External reference
Unresolved reference
2014 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
2013 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2013 · External reference
Unresolved reference
2014 · External reference
Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret
10.1109/jsac.2011.110406 · 2011 · External reference
Toward a classification of finite partial-monitoring games
10.1016/j.tcs.2012.10.008 · 2013 · External reference
Unresolved reference
2019 · External reference
The Multiplicative Weights Update Method: a Meta–Algorithm and Applications
10.4086/toc.2012.v008a006 · 2012 · External reference
An Efficient Dynamic Mechanism
10.3982/ecta6995 · 2013 · External reference
Explorationexploitation Trade–off using Variance Estimates in Multi–Armed Bandits
10.1016/j.tcs.2009.01.016 · 2009 · External reference
Regret Bounds and Minimax Policies under Partial Monitoring
2010 · External reference
Unresolved reference
2010 · External reference
Finite–time Analysis of the Multiarmed Bandit Problem
10.1023/a:1013689704352 · 2002 · External reference
The Nonstochastic Multiarmed Bandit Problem
10.1137/s0097539701398375 · 2002 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2019 · External reference
10.1007/978-3-540-72927-3_33
10.1007/978-3-540-72927-3_33 · 2007 · External reference
Subjectivity and correlation in randomized strategies
10.1016/0304-4068(74)90037-8 · 1974 · External reference
10.1007/978-3-662-44848-9_5
10.1007/978-3-662-44848-9_5 · 2014 · External reference
Unresolved reference
2005 · External reference
Online linear optimization and adaptive routing
10.1016/j.jcss.2007.04.016 · 2008 · External reference
Unresolved reference
2014 · External reference
Dynamic Pricing with Limited Supply
10.1145/2559152 · 2015 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2013 · External reference
Truthful Mechanisms with Implicit Payment Computation
10.1145/2724705 · 2015 · External reference
Characterizing Truthful Multi–armed Bandit Mechanisms
10.1137/120878768 · 2014 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2013 · External reference
Bandits with Knapsacks
10.1145/3164539 · 2018 · External reference
Unresolved reference
2014 · External reference
Unresolved reference
External reference
Unresolved reference
2016 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2018 · External reference
Partial Monitoring – Classification, Regret Bounds, and Algorithms
10.1287/moor.2014.0663 · 2014 · External reference
Unresolved reference
2018 · External reference
Robust Predictions in Games With Incomplete Information
10.3982/ecta11105 · 2013 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2006 · External reference
The Dynamic Pivot Mechanism
10.3982/ecta7260 · 2010 · External reference
10.1007/978-94-015-3711-7
10.1007/978-94-015-3711-7 · 1985 · External reference
Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near–Optimal Algorithms
10.1287/opre.1080.0640 · 2009 · External reference
Blind Network Revenue Management
10.1287/opre.1120.1103 · 2012 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2018 · External reference
Crowdsourcing Exploration
2018 · External reference
Empirical support for winnow and weighted–majority based algorithms: Results on a calendar scheduling domain
10.1023/a:1007335615132 · 1997 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2003 · External reference
From external to internal regret
2007 · External reference
Dynamic pricing and learning: Historical origins, current research, and new directions
2015 · External reference
Strategic Experimentation
10.1111/1468-0262.00022 · 1999 · External reference
Unresolved reference
External reference
Unresolved reference
2018 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2014 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
1949 · External reference
Unresolved reference
2010 · External reference
10.1561/2200000024 · 2012 · Admitted local publication
Unresolved reference
2018 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
External reference
Pure Exploration in MultiArmed Bandit Problems
10.1016/j.tcs.2010.12.059 · 2011 · External reference
Online Optimization in X–Armed Bandits
2011 · External reference
Unresolved reference
2012 · External reference
10.1007/978-3-642-24412-4_14
10.1007/978-3-642-24412-4_14 · 2011 · External reference
Adaptive–treed bandits
2015 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
2013 · External reference
Potential–Based Algorithms in On–Line Prediction and Game Theory
10.1023/a:1022901500417 · 2003 · External reference
10.1017/cbo9780511546921
10.1017/cbo9780511546921 · 2006 · External reference
Combinatorial bandits
10.1016/j.jcss.2012.01.001 · 2012 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
2018 · External reference
An online convex optimization approach to proactive network resource allocation
10.1109/tsp.2017.2750109 · 2017 · External reference
Unresolved reference
2013 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2019 · External reference
Adaptive design methods in clinical trials – a review
2008 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2019 · External reference
Bandits with budgets: Regret lower bounds and optimal algorithms
10.1145/2796314.2745847 · 2015 · External reference
Unresolved reference
1991 · External reference
Unresolved reference
2008 · External reference
Near–optimal noregret algorithms for zero–sum games
10.1016/j.geb.2014.01.003 · 2015 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
2014 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2011 · External reference
Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
10.1145/3284177 · 2019 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2013 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
2018 · External reference
10.1017/cbo9780511581274
10.1017/cbo9780511581274 · 2009 · External reference
Unresolved reference
2012 · External reference
Doubly Robust Policy Evaluation and Optimization
10.1214/14-sts500 · 2014 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2002 · External reference
Action Elimination and Stopping Conditions for the Multi–Armed Bandit and Reinforcement Learning Problems
2006 · External reference
Chasing Ghosts: Competing with Stateful Policies
10.1137/14100227x · 2017 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2005 · External reference
Calibrated learning and correlated equilibrium
10.1006/game.1997.0595 · 1997 · External reference
Asymptotic calibration&
10.1093/biomet/85.2.379 · 1998 · External reference
Regret in the on–line decision problem
10.1006/game.1999.0740 · 1999 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2014 · External reference
A decision–theoretic generalization of on–line learning and an application to boosting
10.1006/jcss.1997.1504 · 1997 · External reference
Unresolved reference
1996 · External reference
10.1006/game.1999.0738
10.1006/game.1999.0738 · 1999 · External reference
Unresolved reference
1997 · External reference
Unresolved reference
2011 · External reference
10.1007/978-3-642-24412-4_16
10.1007/978-3-642-24412-4_16 · 2011 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2013 · External reference
Bandit processes and dynamic allocation indices (with discussion)
10.1111/j.2517-6161.1979.tb01068.x · 1979 · External reference
10.1002/9780470980033
10.1002/9780470980033 · 2011 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2003 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2007 · External reference
The On–Line Shortest Path Problem Under Partial Monitoring
2007 · External reference
Approximation to Bayes risk in repeated play
1957 · External reference
A simple adaptive procedure leading to correlated equilibrium
10.1111/1468-0262.00153 · 2000 · External reference
Introduction to Online Convex Optimization
2015 · External reference
Better algorithms for benign bandits
2011 · External reference
Unresolved reference
2014 · External reference
10.1007/978-3-540-72927-3_36
10.1007/978-3-540-72927-3_36 · 2007 · External reference
Unresolved reference
2016 · External reference
Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal–Agent Problems
10.1613/jair.4940 · 2016 · External reference
Online Evaluation for Information Retrieval
10.1561/1500000051 · 2016 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
External reference
Unresolved reference
2019 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
2011 · External reference
Efficient algorithms for online decision problems
10.1016/j.jcss.2004.10.016 · 2005 · External reference
Unresolved reference
2010 · External reference
Bayesian Persuasion
10.1257/aer.101.6.2590 · 2011 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
2002 · External reference
On the Complexity of Best–Arm Identification in Multi–Armed Bandit Models
2016 · External reference
10.1007/978-3-642-34106-9_18
10.1007/978-3-642-34106-9_18 · 2012 · External reference
Unresolved reference
2018 · External reference
Strategic Experimentation with Exponential Bandits
10.1111/j.1468-0262.2005.00564.x · 2005 · External reference
Triangulation and Embedding Using Small Sets of Beacons
10.1145/1568318.1568322 · 2009 · External reference
Unresolved reference
2005 · External reference
Unresolved reference
2004 · External reference
Unresolved reference
2006 · External reference
Unresolved reference
External reference
Unresolved reference
2003 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2008 · External reference
10.1145/3299873
10.1145/3299873 · External reference
Unresolved reference
2006 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2011 · External reference
Implementing the “Wisdom of the Crowd”
10.1086/676597 · 2014 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
External reference
Unresolved reference
2015 · External reference
Unresolved reference
2014 · External reference
Unresolved reference
2014 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
2015 · External reference
10.1515/9781400829453
10.1515/9781400829453 · 2002 · External reference
Unresolved reference
2008 · External reference
Asymptotically efficient Adaptive Allocation Rules
10.1016/0196-8858(85)90002-8 · 1985 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2016 · External reference
The Weighted Majority Algorithm
10.1006/inco.1994.1009 · 1994 · External reference
Distributed learning in multi–armed bandit with multiple players
10.1109/tsp.2010.2062509 · 2010 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2014 · External reference
Trading regret for efficiency: online convex optimization with long term constraints
2012 · External reference
Unresolved reference
2013 · External reference
10.1007/978-3-642-15883-4_20
10.1007/978-3-642-15883-4_20 · 2010 · External reference
Unresolved reference
2011 · External reference
The sample complexity of exploration in the multi-armed bandit problem
2004 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
1998 · External reference
10.1007/978-3-540-27819-1_8
10.1007/978-3-540-27819-1_8 · 2004 · External reference
On Sequential strategies for loss functions with memory
10.1109/tit.2002.1013135 · 2002 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
2013 · External reference
10.1007/978-3-642-31594-7_59
10.1007/978-3-642-31594-7_59 · 2012 · External reference
Strategically zero-sum games: the class of games whose completely mixed equilibria cannot be improved upon
10.1007/bf01769190 · 1978 · External reference
Unresolved reference
2011 · External reference
10.1561/2200000038 · 2014 · Admitted local publication
Unresolved reference
2007 · External reference
Dynamic Pay-Per- Action Mechanisms and Applications to Online Advertising
10.1287/opre.1120.1124 · 2013 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
2013 · External reference
Unresolved reference
2016 · External reference
Online learning via sequential complexities
2015 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2018 · External reference
An iterative method of solving a game
10.2307/1969530 · 1951 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2009 · External reference
10.1017/cbo9781316779309
10.1017/cbo9781316779309 · 2016 · External reference
10.1287/moor.1100.0446
10.1287/moor.1100.0446 · 2010 · External reference
Learning to Optimize via Posterior Sampling
10.1287/moor.2014.0650 · 2014 · External reference
An Information-Theoretic Analysis of Thompson Sampling
2016 · External reference
10.1561/2200000070 · 2018 · Admitted local publication
Unresolved reference
2018 · External reference
Optimal Dynamic Assortment Planning with Demand Learning
10.1287/msom.2013.0429 · 2013 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
1991 · External reference
Unresolved reference
1942 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
2014 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
2013 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
External reference
Contextual bandits with similarity information
2014 · External reference
Incentivizing exploration via information asymmetry
10.1145/3123744 · 2017 · External reference
Unresolved reference
2008 · External reference
Online Decision Making in Crowdsourcing Markets: Theoretical Challenges
10.1145/2692359.2692364 · 2013 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2005 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
1998 · External reference
Batch learning from logged bandit feedback through counterfactual risk minimization
2015 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2013 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2004 · External reference
On the likelihood that one unknown probability exceeds another in view of the evidence of two samples
10.1093/biomet/25.3-4.285 · 1933 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2013 · External reference
Unresolved reference
2018 · External reference
Close the Gaps: A LearningWhile-Doing Algorithm for Single-Product Revenue Management Problems
10.1287/opre.2013.1245 · 2014 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
2012 · External reference
The K-armed dueling bandits problem
10.1016/j.jcss.2011.12.028 · 2012 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2014 · External reference
Unresolved reference
2016 · External reference
