{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T17:46:03Z","timestamp":1775324763417,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424932","type":"print"},{"value":"9783540446767","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44676-1_35","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T12:43:15Z","timestamp":1179492195000},"page":"416-427","source":"Crossref","is-referenced-by-count":54,"title":["Competitive Auctions for Multiple Digital Goods"],"prefix":"10.1007","author":[{"given":"Andrew V.","family":"Goldberg","sequence":"first","affiliation":[]},{"given":"Jason D.","family":"Hartline","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"35_CR1","unstructured":"A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"H. Chernoff. A Measure of Asymptotic Efficiency for Test of a Hypothesis Based on the Sum of Observations. Anals of Math. Stat., 23:493\u2013509, 1952.","journal-title":"Anals of Math. Stat."},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"E. H. Clarke","year":"1971","unstructured":"E. H. Clarke. Multipart Pricing of Public Goods. Public Choice, 11:17\u201333, 1971.","journal-title":"Public Choice"},{"key":"35_CR4","first-page":"89","volume-title":"Combinatorial Structures and Their Applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds and E. L. Johnson. Matching, a Well-Solved Class of Integer Linear Programs. In R. Guy, H. Haneni, and J. Sch\u00f6nhein, editors, Combinatorial Structures and Their Applications, pages 89\u201392. Gordon and Breach, NY, 1970."},{"key":"35_CR5","first-page":"218","volume-title":"Proc. of 32nd Symposium Theory of Computing","author":"J. Feigenbaum","year":"2000","unstructured":"J. Feigenbaum, C. Papadimitriou, and S. Shenker. Sharing the Cost of Multicast Transmissions. In Proc. of 32nd Symposium Theory of Computing, pages 218\u2013226. ACM Press, New York, 2000."},{"key":"35_CR6","volume-title":"Technical Report STAR-TR-99.09.01","author":"A. V. Goldberg","year":"1999","unstructured":"A. V. Goldberg, J. D. Hartline, and A. Wright. Competitive auctions and digital goods. Technical Report STAR-TR-99.09.01, STAR Laboratory, InterTrust Tech. Corp., Santa Clara, CA, 1999. Available at URL \n                    http:\/\/www.star-lab.com\/tr\/tr-99-01.html\n                    \n                  ."},{"key":"35_CR7","unstructured":"A. V. Goldberg, J. D. Hartline, and A. Wright. Competitive Auctions and Digital Goods. In Proc. 12th Symp. on Discrete Alg., pages 735\u2013744. ACM\/SIAM, 2001."},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T. Groves","year":"1973","unstructured":"T. Groves. Incentives in Teams. Econometrica, 41:617\u2013631, 1973.","journal-title":"Econometrica"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/336992.337016","volume-title":"Proc. of 1st ACM Conf. on E-Commerce","author":"D. Lehmann","year":"1999","unstructured":"D. Lehmann, L. I. O\u0106allaghan, and Y. Shoham. Truth Revelation in Approximately Efficient Combinatorial Auctions. In Proc. of 1st ACM Conf. on E-Commerce, pages 96\u2013102. ACM Press, New York, 1999."},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1016\/S1574-0005(05)80070-0","volume":"2","author":"N. Linial","year":"1994","unstructured":"N. Linial. Game Theoretic Aspects of Computing. In Handbook of Game Theory, volume 2, pages 1339\u20131395. Elseveir Science Publishers B.V., 1994.","journal-title":"Handbook of Game Theory"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511814075"},{"key":"35_CR12","first-page":"129","volume-title":"Proc. of 31st Symposium on Theory of Computing","author":"N. Nisan","year":"1999","unstructured":"N. Nisan and A. Ronen. Algorithmic Mechanism Design. In Proc. of 31st Symposium on Theory of Computing, pages 129\u2013140. ACM Press, New York, 1999."},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"A. E. Roth and M. A. Oliveira Sotomayor. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge University Press, 1990.","DOI":"10.1017\/CCOL052139015X"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"L. S. Shapley","year":"1971","unstructured":"L. S. Shapley. Core of Convex Games. Int. J. of Game Theory, 1:11\u201326, 1971.","journal-title":"Int. J. of Game Theory"},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"L. S. Shapley","year":"1972","unstructured":"L. S. Shapley and M. Shubik. The Assignment Game I: The Core. Int. J. of Game Theory, 1:111\u2013130, 1972.","journal-title":"Int. J. of Game Theory"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. D. Sleator","year":"1985","unstructured":"D. D. Sleator and R. E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of the ACM, 28:202\u2013208, 1985.","journal-title":"Communications of the ACM"},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2977633","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"W. Vickrey. Counterspeculation, Auctions, and Competitive Sealed Tenders. J. of Finance, 16:8\u201337, 1961.","journal-title":"J. of Finance"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44676-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:49:14Z","timestamp":1550324954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44676-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424932","9783540446767"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44676-1_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}