The non-stochastic multi-armed bandit problem
暂无分享,去创建一个
[1] James Hannan,et al. 4. APPROXIMATION TO RAYES RISK IN REPEATED PLAY , 1958 .
[2] A. Banos. On Pseudo-Games , 1968 .
[3] J. Neveu,et al. Discrete Parameter Martingales , 1975 .
[4] N. Megiddo. On repeated games with incomplete information played by non-Bayesian players , 1980 .
[5] Christian M. Ernst,et al. Multi-armed Bandit Allocation Indices , 1989 .
[6] J. Bather,et al. Multi‐Armed Bandit Allocation Indices , 1990 .
[7] Vladimir Vovk,et al. Aggregating strategies , 1990, COLT '90.
[8] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[9] David Haussler,et al. How to use expert advice , 1993, STOC.
[10] Dean P. Foster,et al. A Randomization Rule for Selecting Forecasts , 1993, Oper. Res..
[11] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[12] P. Varaiya,et al. Multi-Armed bandit problem revisited , 1994 .
[13] D. Fudenberg,et al. Consistency and Cautious Fictitious Play , 1995 .
[14] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[15] S. Hart,et al. A simple adaptive procedure leading to correlated equilibrium , 2000 .
[16] Y. Freund,et al. Adaptive game playing using multiplicative weights , 1999 .
[17] Dean P. Foster,et al. Regret in the On-Line Decision Problem , 1999 .
[18] Andreu Mas-Colell,et al. A General Class of Adaptive Strategies , 1999, J. Econ. Theory.
[19] H. Robbins. Some aspects of the sequential design of experiments , 1952 .
[20] T. L. Lai Andherbertrobbins. Asymptotically Efficient Adaptive Allocation Rules , 2022 .