Dynamic pricing with limited supply

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2012, Pages 74-91

  Babaioff, Moshe ^a   Dughmi, Shaddin ^a   Kleinberg, Robert ^b   Slivkins, Aleksandrs ^a  

^a MICROSOFT RESEARCH   (United States)

^b Microsoft Research Redmond ^*  (United States)

Author keywords

dynamic pricing; mechanism design; multi armed bandits; revenue maximization

Indexed keywords

DEMAND DISTRIBUTION; DYNAMIC PRICING; EXPECTED REVENUE; LOWER BOUNDS; MECHANISM DESIGN; MULTI ARMED BANDIT; OFFLINE; PERFORMANCE GUARANTEES; POTENTIAL BUYERS; REVENUE MAXIMIZATION; REVENUE MAXIMIZING;

ELECTRONIC COMMERCE; MACHINE DESIGN;

COSTS;

EID: 84863515685     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2229012.2229023     Document Type: Conference Paper

References (39)

1. ABRAHAM, I., ALONSO, O., KANDYLAS, V., AND SLIVKINS, A. 2012. Adaptive algorithms for crowdsourcing [preliminary title]. Ongoing project.
2. AGRAWAL, R. 1995. The continuum-armed bandit problem. SIAM J. Control & Optimization 33, 6.
3. AUDIBERT, J. AND BUBECK, S. 2010. Regret Bounds and Minimax Policies under Partial Monitoring. J. of Machine Learning Research (JMLR) 11, 2785-2836.
4. AUER, P., CESA-BIANCHI, N., AND FISCHER, P. 2002a. Finite-time analysis of the multiarmed bandit problem. Machine Learning 47, 2-3, 235-256. Preliminary version in 15th ICML, 1998.
5. AUER, P., CESA-BIANCHI, N., FREUND, Y., AND SCHAPIRE, R. E. 2002b. The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32, 1, 48-77. Preliminary version in 36th IEEE FOCS, 1995.
6. AUER, P., ORTNER, R., AND SZEPESVÁRI, C. 2007. Improved Rates for the Stochastic Continuum-Armed Bandit Problem. In 20th COLT. 454-468.
7. BABAIOFF, M., BLUMROSEN, L., DUGHMI, S., AND SINGER, Y. 2011. Posting prices with unknown distributions. In Symp. on Innovations in CS.
8. BABAIOFF, M., KLEINBERG, R., AND SLIVKINS, A. 2010. Truthful mechanisms with implicit payment computation. In 11th ACM EC. 43-52.
9. BABAIOFF, M., SHARMA, Y., AND SLIVKINS, A. 2009. Characterizing truthful multi-armed bandit mechanisms. In 10th ACM EC. 79-88.
10. BAR-YOSSEF, Z., HILDRUM, K., AND WU, F. 2002. Incentive-compatible online auctions for digital goods. In 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
11. BERGEMANN, D. AND VÄLIMÄKI, J. 2006. Bandit Problems. In The New Palgrave Dictionary of Economics, 2nd ed., S. Durlauf and L. Blume, Eds. Macmillan Press.
12. BESBES, O. AND ZEEVI, A. 2009. Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms. Operations Research 57, 1407-1420.
13. BESBES, O. AND ZEEVI, A. 2011. On the minimax complexity of pricing in a changing environment. Operations Reseach 59, 66-79.
14. BLUM, A. AND HARTLINE, J. 2005. Near-optimal online auctions. In 16th ACM-SIAM SODA.
15. BLUM, A., KUMAR, V., RUDRA, A., AND WU, F. 2003. Online learning in online auctions. In 14th ACM-SIAM SODA. 202-204.
16. BUBECK, S., MUNOS, R., AND STOLTZ, G. 2009. Pure Exploration in Multi-Armed Bandit Problems. In 20th ALT.
17. BUBECK, S., MUNOS, R., STOLTZ, G., AND SZEPESVARI, C. 2008. Online Optimization in X-Armed Bandits. In NIPS. 201-208.
18. CESA-BIANCHI, N. AND LUGOSI, G. 2006. Prediction, learning, and games. Cambridge Univ. Press.
19. CHAKRABORTY, T., EVEN-DAR, E., GUHA, S., MANSOUR, Y., AND MUTHUKRISHNAN, S. 2010. Approximation schemes for sequential posted pricing in multi-unit auctions. In WINE. 158-169.
20. CHAWLA, S., HARTLINE, J. D., MALEC, D. L., AND SIVAN, B. 2010. Multi-parameter mechanism design and sequential posted pricing. In ACM STOC. 311-320.
21. DEVANUR, N. AND HARTLINE, J. 2009. Limited and online supply and the bayesian foundations of prior-free mechanism design. In ACM EC.
22. DEVANUR, N. AND KAKADE, S. M. 2009. The price of truthfulness for pay-per-click auctions. In 10th ACM EC. 99-106.
23. DHANGWATNOTAI, P., ROUGHGARDEN, T., AND YAN, Q. 2010. Revenue maximization with a single sample. In ACM EC. 129-138.
24. GITTINS, J. C. 1979. Bandit processes and dynamic allocation indices (with discussion). J. Roy. Statist. Soc. Ser. B 41, 148-177.
25. GOEL, A., KHANNA, S., AND NULL, B. 2009. The Ratio Index for Budgeted Learning, with Applications. In 20th ACM-SIAM SODA. 18-27.
26. HAJIAGHAYI, M. T., KLEINBERG, R., AND PARKES, D. C. 2004. Adaptive limited-supply online auctions. In Proc. ACM Conf. on Electronic Commerce. 71-80.
27. HARTLINE, J. AND ROUGHGARDEN, T. 2008. Optimal mechanism design and money burning. In ACM STOC.
28. KLEINBERG, R. 2004. Nearly tight bounds for the continuum-armed bandit problem. In 18th NIPS.
29. KLEINBERG, R., SLIVKINS, A., AND UPFAL, E. 2008. Multi-Armed Bandits in Metric Spaces. In 40th ACM STOC. 681-690.
30. KLEINBERG, R. D. AND LEIGHTON, F. T. 2003. The value of knowing a demand curve: Bounds on regret for online posted-price auctions. In IEEE FOCS.
31. LAI, T. AND ROBBINS, H. 1985. Asymptotically efficient Adaptive Allocation Rules. Advances in Applied Mathematics 6, 4-22.
32. LAVI, R. AND NISAN, N. 2000. Competitive analysis of incentive compatible on-line auctions. In ACM Conference on Electronic Commerce. 233-241.
33. MCDIARMID, C. 1998. Concentration. In Probabilistic Methods for Discrete Mathematics, M. H. C. M. J. Ramirez and B. Reed, Eds. Springer-Verlag, Berlin, 195-248.
34. MYERSON, R. B. 1981. Optimal auction design. Mathematics of Operations Research 6, 1, 58-73.
35. NAZERZADEH, H., SABERI, A., AND VOHRA, R. 2008. Dynamic cost-per-action mechanisms and applications to online advertising. In 17th WWW.
36. SLIVKINS, A. 2011. Contextual Bandits with Similarity Information. In 24th COLT.
37. SLIVKINS, A. AND UPFAL, E. 2008. Adapting to a Changing Environment: the Brownian Restless Bandits. In 21st COLT. 343-354.
38. WILSON, R. B. 1989. Efficient and competitive rationing. Econometrica 57, 1-40.
39. YAN, Q. 2011. Mechanism design via correlation gap. In 22nd ACM-SIAM SODA.