{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:48:53Z","timestamp":1760298533994,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,4]],"date-time":"2012-06-04T00:00:00Z","timestamp":1338768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,6,4]]},"DOI":"10.1145\/2229012.2229023","type":"proceedings-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T17:35:37Z","timestamp":1338917737000},"page":"74-91","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Dynamic pricing with limited supply"],"prefix":"10.1145","author":[{"given":"Moshe","family":"Babaioff","sequence":"first","affiliation":[{"name":"Microsoft Research Silicon Valley, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaddin","family":"Dughmi","sequence":"additional","affiliation":[{"name":"Microsoft Research Redmond, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Kleinberg","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandrs","family":"Slivkins","sequence":"additional","affiliation":[{"name":"Microsoft Research Silicon Valley, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Abraham I. Alonso O. Kandylas V. and Slivkins A. 2012. Adaptive algorithms for crowdsourcing {preliminary title}. Ongoing project. Abraham I. Alonso O. Kandylas V. and Slivkins A. 2012. Adaptive algorithms for crowdsourcing {preliminary title}. Ongoing project."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012992237273"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1953023"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Auer P. Ortner R. and Szepesv\u00e1ri C. 2007. Improved Rates for the Stochastic Continuum-Armed Bandit Problem. In 20th COLT. 454--468. Auer P. Ortner R. and Szepesv\u00e1ri C. 2007. Improved Rates for the Stochastic Continuum-Armed Bandit Problem. In 20th COLT. 454--468.","DOI":"10.1007\/978-3-540-72927-3_33"},{"volume-title":"Symp. on Innovations in CS.","author":"Babaioff M.","key":"e_1_3_2_1_7_1","unstructured":"Babaioff , M. , Blumrosen , L. , Dughmi , S. , and Singer , Y . 2011. Posting prices with unknown distributions . In Symp. on Innovations in CS. Babaioff, M., Blumrosen, L., Dughmi, S., and Singer, Y. 2011. Posting prices with unknown distributions. In Symp. on Innovations in CS."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807349"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566386"},{"volume-title":"13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Bar-Yossef Z.","key":"e_1_3_2_1_10_1","unstructured":"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). 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)."},{"key":"e_1_3_2_1_11_1","unstructured":"Bergemann D. and Valimaki J. 2006. Bandit Problems. In The New Palgrave Dictionary of Economics 2nd ed. S. Durlauf and L. Blume Eds. Macmillan Press. Bergemann D. and Valimaki J. 2006. Bandit Problems. In The New Palgrave Dictionary of Economics 2nd ed. S. Durlauf and L. Blume Eds. Macmillan Press."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0640"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0867"},{"key":"e_1_3_2_1_14_1","unstructured":"Blum A. and Hartline J. 2005. Near-optimal online auctions. In 16th ACM-SIAM SODA. Blum A. and Hartline J. 2005. Near-optimal online auctions. In 16th ACM-SIAM SODA."},{"key":"e_1_3_2_1_15_1","unstructured":"Blum A. Kumar V. Rudra A. and Wu F. 2003. Online learning in online auctions. In 14th ACM-SIAM SODA. 202--204. Blum A. Kumar V. Rudra A. and Wu F. 2003. Online learning in online auctions. In 14th ACM-SIAM SODA. 202--204."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Bubeck S. Munos R. and Stoltz G. 2009. Pure Exploration in Multi-Armed Bandit Problems. In 20th ALT. Bubeck S. Munos R. and Stoltz G. 2009. Pure Exploration in Multi-Armed Bandit Problems. In 20th ALT.","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"e_1_3_2_1_17_1","unstructured":"Bubeck S. Munos R. Stoltz G. and Szepesvari C. 2008. Online Optimization in X-Armed Bandits. In NIPS. 201--208. Bubeck S. Munos R. Stoltz G. and Szepesvari C. 2008. Online Optimization in X-Armed Bandits. In NIPS. 201--208."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi N. and Lugosi G. 2006. Prediction learning and games. Cambridge Univ. Press. Cesa-Bianchi N. and Lugosi G. 2006. Prediction learning and games. Cambridge Univ. Press.","DOI":"10.1017\/CBO9780511546921"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"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. 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.","DOI":"10.1007\/978-3-642-17572-5_13"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566381"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566388"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807364"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1111\/j.2517-6161.1979.tb01068.x","article-title":"Bandit processes and dynamic allocation indices (with discussion)","volume":"41","author":"Gittins J. C.","year":"1979","unstructured":"Gittins , J. C. 1979 . Bandit processes and dynamic allocation indices (with discussion) . J. Roy. Statist. Soc. Ser. B 41 , 148 -- 177 . Gittins, J. C. 1979. Bandit processes and dynamic allocation indices (with discussion). J. Roy. Statist. Soc. Ser. B 41, 148--177.","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Goel A. Khanna S. and Null B. 2009. The Ratio Index for Budgeted Learning with Applications. In 20th ACM-SIAM SODA. 18--27. Goel A. Khanna S. and Null B. 2009. The Ratio Index for Budgeted Learning with Applications. In 20th ACM-SIAM SODA. 18--27.","DOI":"10.1137\/1.9781611973068.3"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988784"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374390"},{"volume-title":"18th NIPS.","author":"Kleinberg R.","key":"e_1_3_2_1_28_1","unstructured":"Kleinberg , R. 2004. Nearly tight bounds for the continuum-armed bandit problem . In 18th NIPS. Kleinberg, R. 2004. Nearly tight bounds for the continuum-armed bandit problem. In 18th NIPS."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374475"},{"key":"e_1_3_2_1_30_1","unstructured":"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. 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."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352897"},{"volume-title":"Probabilistic Methods for Discrete Mathematics","author":"McDiarmid C.","key":"e_1_3_2_1_33_1","unstructured":"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. 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."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367522"},{"volume-title":"24th COLT.","author":"Slivkins A.","key":"e_1_3_2_1_36_1","unstructured":"Slivkins , A. 2011. Contextual Bandits with Similarity Information . In 24th COLT. Slivkins, A. 2011. Contextual Bandits with Similarity Information. In 24th COLT."},{"key":"e_1_3_2_1_37_1","unstructured":"Slivkins A. and Upfal E. 2008. Adapting to a Changing Environment: the Brownian Restless Bandits. In 21st COLT. 343--354. Slivkins A. and Upfal E. 2008. Adapting to a Changing Environment: the Brownian Restless Bandits. In 21st COLT. 343--354."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.2307\/1912571"},{"volume-title":"22nd ACM-SIAM SODA.","author":"Yan Q.","key":"e_1_3_2_1_39_1","unstructured":"Yan , Q. 2011. Mechanism design via correlation gap . In 22nd ACM-SIAM SODA. Yan, Q. 2011. Mechanism design via correlation gap. In 22nd ACM-SIAM SODA."}],"event":{"name":"EC '12: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Valencia Spain","acronym":"EC '12"},"container-title":["Proceedings of the 13th ACM Conference on Electronic Commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229023","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2229012.2229023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:59Z","timestamp":1750236539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,4]]},"references-count":39,"alternative-id":["10.1145\/2229012.2229023","10.1145\/2229012"],"URL":"https:\/\/doi.org\/10.1145\/2229012.2229023","relation":{},"subject":[],"published":{"date-parts":[[2012,6,4]]},"assertion":[{"value":"2012-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}