{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T02:08:33Z","timestamp":1763258913801,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"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":[[2007,6,11]]},"DOI":"10.1145\/1250910.1250912","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Beyond moulin mechanisms"],"prefix":"10.1145","author":[{"given":"Aranyak","family":"Mehta","sequence":"first","affiliation":[{"name":"IBM, Almaden, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Roughgarden","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mukund","family":"Sundararajan","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792236237"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703405754"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_3_2_1_4_1","volume-title":"Linear Programming","author":"Chv\u00e1tal V.","year":"1983","unstructured":"V. Chv\u00e1tal . Linear Programming . Freeman , 1983 . V. Chv\u00e1tal. Linear Programming. Freeman, 1983."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1062104.1700886"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00085-9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0993"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Gupta A.","year":"2007","unstructured":"A. Gupta , J. K\u00f6nemann , S. Leonardi , R. Ravi , and G. Sch\u00e4fer . An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem . In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , 2007 . A. Gupta, J. K\u00f6nemann, S. Leonardi, R. Ravi, and G. Sch\u00e4fer. An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946349"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27821-4_13"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581035"},{"key":"e_1_3_2_1_14_1","first-page":"602","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Immorlica N.","year":"2005","unstructured":"N. Immorlica , M. Mahdian , and V. S. Mirrokni . Limitations of cross-monotonic cost-sharing schemes . In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 602 -- 611 , 2005 . N. Immorlica, M. Mahdian, and V. S. Mirrokni. Limitations of cross-monotonic cost-sharing schemes. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 602--611, 2005."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/950620.950621"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380825"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509956"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375845"},{"key":"e_1_3_2_1_19_1","first-page":"612","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"K\u00f6nemann J.","year":"2005","unstructured":"J. K\u00f6nemann , S. Leonardi , and G. Sch\u00e4fer . A group-strategyproof mechanism for Steiner forests . In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 612 -- 619 , 2005 . J. K\u00f6nemann, S. Leonardi, and G. Sch\u00e4fer. A group-strategyproof mechanism for Steiner forests. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 612--619, 2005."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.07.033"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s003550050145"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00004200"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946350"},{"key":"e_1_3_2_1_24_1","first-page":"74","volume-title":"Proceedings of the 17th National Conference on Artificial Intelligence (AAAI)","author":"Parkes D. C.","year":"2000","unstructured":"D. C. Parkes and L. H. Ungar . Iterative combinatorial auctions: Theory and practice . In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI) , pages 74 -- 81 , 2000 . D. C. Parkes and L. H. Ungar. Iterative combinatorial auctions: Theory and practice. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI), pages 74--81, 2000."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132528"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72792-7_35"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258600"},{"key":"e_1_3_2_1_28_1","unstructured":"V. V. Vazirani.Approximation Algorithms. Springer 2001.   V. V. Vazirani.Approximation Algorithms. Springer 2001."}],"event":{"name":"EC07: ACM Conference on Electronic Commerce","sponsor":["ACM Association for Computing Machinery","SIGecom Special Interest Group on Economics and Computation"],"location":"San Diego California USA","acronym":"EC07"},"container-title":["Proceedings of the 8th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250910.1250912","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250910.1250912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:47Z","timestamp":1750258067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250910.1250912"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":28,"alternative-id":["10.1145\/1250910.1250912","10.1145\/1250910"],"URL":"https:\/\/doi.org\/10.1145\/1250910.1250912","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}