{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:51:01Z","timestamp":1756572661978,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"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.1064031","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"203-212","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["First-price path auctions"],"prefix":"10.1145","author":[{"given":"Nicole","family":"Immorlica","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Karger","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evdokia","family":"Nikolova","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Sami","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129086"},{"key":"e_1_3_2_1_2_1","first-page":"991","volume-title":"Frugal Path Mechanisms. In Proceeding of the 13th ACM Symposium on Discrete Algorithms","author":"Archer A.","year":"2002","unstructured":"A. Archer and E. T\u00e1rdos . Frugal Path Mechanisms. In Proceeding of the 13th ACM Symposium on Discrete Algorithms 2002 , pp. 991 -- 999 . A. Archer and E. T\u00e1rdos. Frugal Path Mechanisms. In Proceeding of the 13th ACM Symposium on Discrete Algorithms 2002, pp. 991--999."},{"key":"e_1_3_2_1_3_1","volume-title":"Contributions to the Theory of Games, Annals of Mathematical Studies 40","author":"Aumann R.J.","year":"1959","unstructured":"R.J. Aumann . Acceptable points in general cooperative n-person games . In: A.W. Tucker, R.D.Luce (Eds.), Contributions to the Theory of Games, Annals of Mathematical Studies 40 , Princeton University Press , Princeton, New Jersey, 1959 . R.J. Aumann. Acceptable points in general cooperative n-person games. In: A.W. Tucker, R.D.Luce (Eds.), Contributions to the Theory of Games, Annals of Mathematical Studies 40, Princeton University Press, Princeton, New Jersey, 1959."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01726210"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4871-0"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011782"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/779928.779982"},{"key":"e_1_3_2_1_8_1","first-page":"701","volume-title":"Proceedings of 15th ACM Symposium on Discrete Algorithms","author":"Elkind E.","year":"2004","unstructured":"E. Elkind , A. Sahai and K. Steiglitz . Frugality in Path Auctions . In Proceedings of 15th ACM Symposium on Discrete Algorithms , 2004 , pp. 701 -- 709 . E. Elkind, A. Sahai and K. Steiglitz. Frugality in Path Auctions. In Proceedings of 15th ACM Symposium on Discrete Algorithms, 2004, pp. 701--709."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571856"},{"key":"e_1_3_2_1_10_1","volume-title":"Computers and Intractability","author":"Garey M.","year":"1979","unstructured":"M. Garey , and D. Johnson . Computers and Intractability . Freeman Press , New York , 1979 . M. Garey, and D. Johnson. Computers and Intractability. Freeman Press, New York, 1979."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875576"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s003550100152"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(79)90060-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2307\/2298115"},{"key":"e_1_3_2_1_16_1","first-page":"28","volume-title":"Proceedings of the 44th IEEE Symposium on the Foundations of Computer Science","author":"Mihail M.","year":"2001","unstructured":"M. Mihail , C. H. Papadimitriou , A. Saberi . On Certain Connectivity Properties of the Internet Topology . In Proceedings of the 44th IEEE Symposium on the Foundations of Computer Science , 2001 , pp. 28 -- 35 . M. Mihail, C. H. Papadimitriou, A. Saberi. On Certain Connectivity Properties of the Internet Topology. In Proceedings of the 44th IEEE Symposium on the Foundations of Computer Science, 2001, pp. 28--35."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0790"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-4896(98)00039-0"}],"event":{"name":"EC05: Sixth ACM Conference on Electronic Commerce 2005","sponsor":["ACM Association for Computing Machinery","SIGecom Special Interest Group on Economics and Computation"],"location":"Vancouver BC Canada","acronym":"EC05"},"container-title":["Proceedings of the 6th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064009.1064031","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1064009.1064031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:50Z","timestamp":1750262870000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064009.1064031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,5]]},"references-count":19,"alternative-id":["10.1145\/1064009.1064031","10.1145\/1064009"],"URL":"https:\/\/doi.org\/10.1145\/1064009.1064031","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"}}]}}