Learning the demand curve in posted-price digital goods auctions

10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011

Volumn 1, Issue , 2011, Pages 57-64

  Chhabra, Meenal ^a   Das, Sanmay ^a  

^a Rensselaer Polytechnic Institute   (United States)

Author keywords

Economically motivated agents; Electronic markets; Single agent learning

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; COMMERCE; MULTI AGENT SYSTEMS;

DOMAIN KNOWLEDGE; ELECTRONIC MARKET; FREE PARAMETERS; MULTI ARMED BANDIT; POTENTIAL BUYERS; REVENUE MAXIMIZATION PROBLEM; SINGLE AGENT LEARNING; SOCIAL AND BEHAVIORAL SCIENCE;

COSTS;

EID: 84899413507     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2):235-256, 2002.
2. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. Schapire. Gambling in a rigged casino: The adversarial multi-armed bandit problem. In Proc. FOCS, volume 36, pages 322-331. IEEE Computer Society Press, 1995.
3. A. Blum, V. Kumar, A. Rudra, and F. Wu. Online learning in online auctions. Theoretical Computer Science, 324(2-3): 137-146, 2004.
4. T. Chakraborty, Z. Huang, and S. Khanna. Dynamic and non-uniform pricing strategies for revenue maximization. In Proc. FOCS, 2009.
5. Y. Chen and R. Wang. Learning buyers' valuation distribution in posted-price selling. Economic Theory, 14(2):417-428, 1999.
6. V. Conitzer and N. Garera. Learning algorithms for online principal-agent problems (and selling goods online). In Proceedings of the 23rd, international conference on Machine learning, pages 209-216. ACM, 2006.
7. S. Deis and M. Magdon-Ismail. Adapting to a market shock: Optimal sequential market-making. In Advances in Neural Information Processing Systems (NIPS), pages 361-368, 2008.
8. J. Gittins. Bandit processes and dynamic allocation indices. Journal of the Royal Statistical Society. Series B (Methodological), 41(2):148-177, 1979.
9. J. Gittins. Multi-armed bandit allocation indices. John Wiley fc Sons Inc, 1989.
10. J. Gittins and D. Jones. A dynamic allocation index for the discounted multiarmed bandit problem. Biometrika, 66(3):561-565, 1979.
11. A. Goldberg and J. Hartline. Envy-free auctions for digital goods. In Proc. ACM EC, pages 29-35. ACM New York, NY, USA, 2003.
12. A. Goldberg, J. Hartline, and A. Wright. Competitive auctions for multiple digital goods. In Proc. ESA, pages 416-427. Springer, 2001.
13. J. Kephart, J. Hanson, and A. Greenwald. Dynamic pricing by software agents. Computer Networks, 32(6):731-752, 2000.
14. R. Kleinberg. Nearly tight bounds for the continuum-armed bandit problem. Advances in Neural Information Processing Systems, 18, 2005.
15. R. Kleinberg and T. Leighton. The value of knowing a demand curve: Bounds on regret for on-line posted-price auctions. In Proc. FOCS, 2003.
16. M. Rothschild. A two-armed bandit theory of market pricing. Journal of Economic Theory, 9(2):185-202, 1974.
17. I. Ryzhov, P. Frazier, and W. Powell. On the robustness of a one-period look-ahead policy in multi-armed bandit problems. Procedia Computer Science, 1(1):1629-1638, 2010.
18. I. Ryzhov, W. Powell, and P. Frazier. The knowledge gradient algorithm for a general class of online learning problems. Submitted for publication, 2008.
19. I. Segal. Optimal pricing mechanisms with unknown demand. American Economic Review, 93(3):509-529, 2003.
20. J. Vermorel and M. Mohri. Multi-armed bandit algorithms and empirical evaluation. In Proc. ECML, pages 437-446. Springer, 2005.