Online Pricing with Strategic and Patient Buyers
暂无分享,去创建一个
Roi Livni | Yishay Mansour | Michal Feldman | Aviv Zohar | Tomer Koren | Aviv Zohar | Y. Mansour | Tomer Koren | M. Feldman | Roi Livni
[1] Ambuj Tewari,et al. Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret , 2012, ICML.
[2] Umar Syed,et al. Learning Prices for Repeated Auctions with Strategic Buyers , 2013, NIPS.
[3] Maria-Florina Balcan,et al. Reducing mechanism design to algorithm design via machine learning , 2007, J. Comput. Syst. Sci..
[4] Peter Auer,et al. The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..
[5] Yuval Peres,et al. Bandits with switching costs: T2/3 regret , 2013, STOC.
[6] Tim Roughgarden,et al. Making the Most of Your Samples , 2014, EC.
[7] Mehryar Mohri,et al. Revenue Optimization against Strategic Buyers , 2015, NIPS.
[8] Frank Thomson Leighton,et al. The value of knowing a demand curve: bounds on regret for online posted-price auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[9] Shuchi Chawla,et al. Algorithmic pricing via virtual valuations , 2007, EC '07.
[10] Mehryar Mohri,et al. Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers , 2014, NIPS.
[11] Richard Cole,et al. The sample complexity of revenue maximization , 2014, STOC.
[12] Shuchi Chawla,et al. The power of randomness in bayesian optimal mechanism design , 2010, EC '10.
[13] Shuchi Chawla,et al. Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.