Abstract
Rights: UNKNOWN · Source: journal-auto-sync:external:CROSSREF_ISSN
Aleksandrs Slivkins
Abstract
Rights: UNKNOWN · Source: journal-auto-sync:external:CROSSREF_ISSN
Authors
Institutions
No ROR-resolved institution is linked to this work yet.
Provenance
crossref
Confidence 100%
unpaywall
Confidence 95%
datacite
Confidence 0%
Unresolved referenced work
2011
Unresolved referenced work
2017
Unresolved referenced work
2005
Unresolved referenced work
2017
Unresolved referenced work
Kept as external metadata until matched
Unresolved referenced work
Kept as external metadata until matched
Unresolved referenced work
2012
Unresolved referenced work
2014
Unresolved referenced work
2017
Competition and Innovation: An Inverted U Relationship
2005
The continuum-armed bandit problem
10.1137/s0363012992237273 · 1995
Unresolved referenced work
2016
Unresolved referenced work
2014
Unresolved referenced work
2016
Unresolved referenced work
2016
Unresolved referenced work
2012
Unresolved referenced work
2013
A Dynamic Near-Optimal Algorithm for Online Linear Programming
10.1287/opre.2014.1289 · 2014
Unresolved referenced work
2014
Unresolved referenced work
2015
Unresolved referenced work
2013
Unresolved referenced work
2011
Unresolved referenced work
2013
Unresolved referenced work
2014
Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret
10.1109/jsac.2011.110406 · 2011
Toward a classification of finite partial-monitoring games
10.1016/j.tcs.2012.10.008 · 2013
Unresolved referenced work
2019
The Multiplicative Weights Update Method: a Meta–Algorithm and Applications
10.4086/toc.2012.v008a006 · 2012
An Efficient Dynamic Mechanism
10.3982/ecta6995 · 2013
Explorationexploitation Trade–off using Variance Estimates in Multi–Armed Bandits
10.1016/j.tcs.2009.01.016 · 2009
Regret Bounds and Minimax Policies under Partial Monitoring
2010
Unresolved referenced work
2010
Finite–time Analysis of the Multiarmed Bandit Problem
10.1023/a:1013689704352 · 2002
The Nonstochastic Multiarmed Bandit Problem
10.1137/s0097539701398375 · 2002
Unresolved referenced work
2016
Unresolved referenced work
2019
10.1007/978-3-540-72927-3_33
10.1007/978-3-540-72927-3_33 · 2007
Subjectivity and correlation in randomized strategies
10.1016/0304-4068(74)90037-8 · 1974
10.1007/978-3-662-44848-9_5
10.1007/978-3-662-44848-9_5 · 2014
Unresolved referenced work
2005
The K-armed dueling bandits problem
10.1016/j.jcss.2011.12.028 · doi-reference
Close the Gaps: A LearningWhile-Doing Algorithm for Single-Product Revenue Management Problems
10.1287/opre.2013.1245 · doi-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 · doi-reference
Online Decision Making in Crowdsourcing Markets: Theoretical Challenges
10.1145/2692359.2692364 · doi-reference
Incentivizing exploration via information asymmetry
10.1145/3123744 · doi-reference
Optimal Dynamic Assortment Planning with Demand Learning
10.1287/msom.2013.0429 · doi-reference
Learning to Optimize via Posterior Sampling
10.1287/moor.2014.0650 · doi-reference
10.1287/moor.1100.0446
10.1287/moor.1100.0446 · doi-reference
10.1017/cbo9781316779309
10.1017/cbo9781316779309 · doi-reference
An iterative method of solving a game
10.2307/1969530 · doi-reference
Dynamic Pay-Per- Action Mechanisms and Applications to Online Advertising
10.1287/opre.1120.1124 · doi-reference
Strategically zero-sum games: the class of games whose completely mixed equilibria cannot be improved upon
10.1007/bf01769190 · doi-reference
10.1007/978-3-642-31594-7_59
10.1007/978-3-642-31594-7_59 · doi-reference
On Sequential strategies for loss functions with memory
10.1109/tit.2002.1013135 · doi-reference
10.1007/978-3-540-27819-1_8
10.1007/978-3-540-27819-1_8 · doi-reference
10.1007/978-3-642-15883-4_20
10.1007/978-3-642-15883-4_20 · doi-reference
Distributed learning in multi–armed bandit with multiple players
10.1109/tsp.2010.2062509 · doi-reference
The Weighted Majority Algorithm
10.1006/inco.1994.1009 · doi-reference
Asymptotically efficient Adaptive Allocation Rules
10.1016/0196-8858(85)90002-8 · doi-reference
10.1515/9781400829453
10.1515/9781400829453 · doi-reference
Implementing the “Wisdom of the Crowd”
10.1086/676597 · doi-reference
10.1145/3299873
10.1145/3299873 · doi-reference
Triangulation and Embedding Using Small Sets of Beacons
10.1145/1568318.1568322 · doi-reference
Strategic Experimentation with Exponential Bandits
10.1111/j.1468-0262.2005.00564.x · doi-reference
10.1007/978-3-642-34106-9_18
10.1007/978-3-642-34106-9_18 · doi-reference
Bayesian Persuasion
10.1257/aer.101.6.2590 · doi-reference
Efficient algorithms for online decision problems
10.1016/j.jcss.2004.10.016 · doi-reference
Online Evaluation for Information Retrieval
10.1561/1500000051 · doi-reference
Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal–Agent Problems
10.1613/jair.4940 · doi-reference
A simple adaptive procedure leading to correlated equilibrium
10.1111/1468-0262.00153 · doi-reference
10.1002/9780470980033
10.1002/9780470980033 · doi-reference
Bandit processes and dynamic allocation indices (with discussion)
10.1111/j.2517-6161.1979.tb01068.x · doi-reference
10.1007/978-3-642-24412-4_16
10.1007/978-3-642-24412-4_16 · doi-reference
10.1006/game.1999.0738
10.1006/game.1999.0738 · doi-reference
A decision–theoretic generalization of on–line learning and an application to boosting
10.1006/jcss.1997.1504 · doi-reference
Regret in the on–line decision problem
10.1006/game.1999.0740 · doi-reference
Asymptotic calibration&
10.1093/biomet/85.2.379 · doi-reference
Calibrated learning and correlated equilibrium
10.1006/game.1997.0595 · doi-reference
Chasing Ghosts: Competing with Stateful Policies
10.1137/14100227x · doi-reference
Doubly Robust Policy Evaluation and Optimization
10.1214/14-sts500 · doi-reference