Optimal Algorithm for Bayesian Incentive-Compatible Exploration
暂无分享,去创建一个
[1] Jon M. Kleinberg,et al. Incentivizing exploration , 2014, EC.
[2] Emir Kamenica,et al. Bayesian Persuasion , 2009 .
[3] Yishay Mansour,et al. Competing Bandits: Learning Under Competition , 2017, ITCS.
[4] Yishay Mansour,et al. Bayesian Incentive-Compatible Bandit Exploration , 2015, EC.
[5] Aleksandrs Slivkins. Incentivizing exploration via information asymmetry , 2017, XRDS.
[6] Moshe Tennenholtz,et al. Economic Recommendation Systems: One Page Abstract , 2016, EC.
[7] Haifeng Xu,et al. Algorithmic Bayesian persuasion , 2015, STOC.
[8] J. Bather,et al. Multi‐Armed Bandit Allocation Indices , 1990 .
[9] Shaddin Dughmi,et al. Persuasion with Limited Communication , 2016, EC.
[10] Yishay Mansour,et al. Bayesian Exploration: Incentivizing Exploration in Bayesian Games , 2016, EC.
[11] Yishay Mansour,et al. Implementing the “Wisdom of the Crowd” , 2013, Journal of Political Economy.
[12] Kevin D. Glazebrook,et al. Multi-Armed Bandit Allocation Indices: Gittins/Multi-Armed Bandit Allocation Indices , 2011 .
[13] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[14] Yeon-Koo Che,et al. Optimal Design for Social Learning , 2015 .
[15] Haifeng Xu,et al. Algorithmic Persuasion with No Externalities , 2017, EC.