{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:46Z","timestamp":1750308166619,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,5]],"date-time":"2005-06-05T00:00:00Z","timestamp":1117929600000},"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":[[2005,6,5]]},"DOI":"10.1145\/1064009.1064028","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"175-182","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["From optimal limited to unlimited supply auctions"],"prefix":"10.1145","author":[{"given":"Jason D.","family":"Hartline","sequence":"first","affiliation":[{"name":"Microsoft Research, Mountain View, CA"}]},{"given":"Robert","family":"McGrew","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA"}]}],"member":"320","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.5555\/874063.875583"},{"key":"e_1_3_2_1_2_1","first-page":"3","article-title":"Market research and market design","author":"Baliga S.","year":"2003","unstructured":"S. Baliga and R. Vohra . Market research and market design . Advances in Theoretical Economics , 3 , 2003 . S. Baliga and R. Vohra. Market research and market design. Advances in Theoretical Economics, 3, 2003.","journal-title":"Advances in Theoretical Economics"},{"key":"e_1_3_2_1_3_1","volume-title":"Online Computation and Competitive Analysis","author":"Borodin A.","year":"1998","unstructured":"A. Borodin and R. El-Yaniv . Online Computation and Competitive Analysis . Cambridge University Press , 1998 . A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1086\/261643"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/509907.509921"},{"key":"e_1_3_2_1_6_1","volume-title":"Games and Economic Behavior","author":"Goldberg A.","year":"2002","unstructured":"A. Goldberg , J. Hartline , A. Karlin , M. Saks , and A. Wright . Competitive auctions and digital goods . Games and Economic Behavior , 2002 . Submitted for publication. An earlier version available as InterTrust Technical Report at URL http:\/\/www.star-lab.com\/tr\/tr-99-01.html. A. Goldberg, J. Hartline, A. Karlin, M. Saks, and A. Wright. Competitive auctions and digital goods. Games and Economic Behavior, 2002. Submitted for publication. An earlier version available as InterTrust Technical Report at URL http:\/\/www.star-lab.com\/tr\/tr-99-01.html."},{"key":"e_1_3_2_1_7_1","first-page":"215","volume-title":"Proc. 14th Symposium on Discrete Algorithms","author":"Goldberg A. V.","year":"2003","unstructured":"A. V. Goldberg and J. D. Hartline . Competitiveness via consensus . In Proc. 14th Symposium on Discrete Algorithms , pages 215 -- 222 . ACM\/SIAM, 2003 . A. V. Goldberg and J. D. Hartline. Competitiveness via consensus. In Proc. 14th Symposium on Discrete Algorithms, pages 215--222. ACM\/SIAM, 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/978-3-540-24749-4_56"},{"key":"e_1_3_2_1_9_1","first-page":"735","volume-title":"Proc. 12th Symposium on Discrete Algorithms","author":"Goldberg A. V.","year":"2001","unstructured":"A. V. Goldberg , J. D. Hartline , and A. Wright . Competitive auctions and digital goods . In Proc. 12th Symposium on Discrete Algorithms , pages 735 -- 744 . ACM\/SIAM, 2001 . A. V. Goldberg, J. D. Hartline, and A. Wright. Competitive auctions and digital goods. In Proc. 12th Symposium on Discrete Algorithms, pages 735--744. ACM\/SIAM, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/336992.337016"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1007\/PL00004200"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1287\/moor.6.1.58"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/301250.301287"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1257\/000282803322156963"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGecom Special Interest Group on Economics and Computation"],"acronym":"EC05","name":"EC05: Sixth ACM Conference on Electronic Commerce 2005","location":"Vancouver BC Canada"},"container-title":["Proceedings of the 6th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064009.1064028","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1064009.1064028","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:19:12Z","timestamp":1750263552000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064009.1064028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,5]]},"references-count":15,"alternative-id":["10.1145\/1064009.1064028","10.1145\/1064009"],"URL":"https:\/\/doi.org\/10.1145\/1064009.1064028","relation":{},"subject":[],"published":{"date-parts":[[2005,6,5]]},"assertion":[{"value":"2005-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}