{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:52:21Z","timestamp":1760298741356,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"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":[[2013,6,16]]},"DOI":"10.1145\/2492002.2482591","type":"proceedings-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T16:03:50Z","timestamp":1370966630000},"page":"453-470","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Cost-recovering bayesian algorithmic mechanism design"],"prefix":"10.1145","author":[{"given":"Hu","family":"Fu","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brendan","family":"Lucier","sequence":"additional","affiliation":[{"name":"Microsoft Research New England, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balasubramanian","family":"Sivan","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasilis","family":"Syrgkanis","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. 205--214","author":"Archer A.","year":"2003","unstructured":"Archer , A. , Papadimitriou , C. H. , Talwar , K. , and Tardos , \u00c9. 2003 . An approximate truthful mechanism for combinatorial auctions with single parameter agents . In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. 205--214 . Archer, A., Papadimitriou, C. H., Talwar, K., and Tardos, \u00c9. 2003. An approximate truthful mechanism for combinatorial auctions with single parameter agents. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. 205--214."},{"volume-title":"Proceedings of 22nd annual ACM-SIAM Symposium on Discrete Algorithms. 720--733","author":"Bei X.","key":"e_1_3_2_1_2_1","unstructured":"Bei , X. and Huang , Z . 2011. Bayesian incentive compatibility via fractional assignments . In Proceedings of 22nd annual ACM-SIAM Symposium on Discrete Algorithms. 720--733 . Bei, X. and Huang, Z. 2011. Bayesian incentive compatibility via fractional assignments. In Proceedings of 22nd annual ACM-SIAM Symposium on Discrete Algorithms. 720--733."},{"volume-title":"Proceedings of the 24th annual conference on Theoretical aspects of computer science. STACS'07. Springer-Verlag","author":"Brenner J.","key":"e_1_3_2_1_3_1","unstructured":"Brenner , J. and Sch\u00e4fer , G . 2007. Cost sharing methods for makespan and completion time scheduling . In Proceedings of the 24th annual conference on Theoretical aspects of computer science. STACS'07. Springer-Verlag , Berlin, Heidelberg, 670--681. Brenner, J. and Sch\u00e4fer, G. 2007. Cost sharing methods for makespan and completion time scheduling. In Proceedings of the 24th annual conference on Theoretical aspects of computer science. STACS'07. Springer-Verlag, Berlin, Heidelberg, 670--681."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11944874_11"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79309-0_29"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1754"},{"volume-title":"Proceedings of 23rd annual ACM-SIAM Symposium on Discrete Algorithms. 896--913","author":"Georgiou K.","key":"e_1_3_2_1_7_1","unstructured":"Georgiou , K. and Swamy , C . 2012. Black-box reductions for cost-sharing mechanism design . In Proceedings of 23rd annual ACM-SIAM Symposium on Discrete Algorithms. 896--913 . Georgiou, K. and Swamy, C. 2012. Black-box reductions for cost-sharing mechanism design. In Proceedings of 23rd annual ACM-SIAM Symposium on Discrete Algorithms. 896--913."},{"volume-title":"Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. SODA '07","author":"Gupta A.","key":"e_1_3_2_1_8_1","unstructured":"Gupta , A. , K\u00f6nemann , J. , Leonardi , S. , Ravi , R. , and Sch\u00e4fer , G . 2007. An efficient cost-sharing mechanism for the prize-collecting steiner forest problem . In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. SODA '07 . Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1153--1162. Gupta, A., K\u00f6nemann, J., Leonardi, S., Ravi, R., and Sch\u00e4fer, G. 2007. An efficient cost-sharing mechanism for the prize-collecting steiner forest problem. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. SODA '07. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1153--1162."},{"volume-title":"Proceedings of the 22nd annual ACM-SIAM Symposium on Discrete Algorithms. 734--747","author":"Hartline J. D.","key":"e_1_3_2_1_9_1","unstructured":"Hartline , J. D. , Kleinberg , R. , and Malekian , A . 2011. Bayesian incentive compatibility via matchings . In Proceedings of the 22nd annual ACM-SIAM Symposium on Discrete Algorithms. 734--747 . Hartline, J. D., Kleinberg, R., and Malekian, A. 2011. Bayesian incentive compatibility via matchings. In Proceedings of the 22nd annual ACM-SIAM Symposium on Discrete Algorithms. 734--747."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806732"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1361192.1361201"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380825"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s003550050145"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00004200"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"volume-title":"Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. FOCS '03. IEEE Computer Society","author":"P\u00e1l M.","key":"e_1_3_2_1_16_1","unstructured":"P\u00e1l , M. and Tardos , E . 2003. Group strategyproof mechanisms via primal-dual algorithms . In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. FOCS '03. IEEE Computer Society , Washington, DC, USA, 584--. P\u00e1l, M. and Tardos, E. 2003. Group strategyproof mechanisms via primal-dual algorithms. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. FOCS '03. IEEE Computer Society, Washington, DC, USA, 584--."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72792-7_35"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538907"}],"event":{"name":"EC '13: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Philadelphia Pennsylvania USA","acronym":"EC '13"},"container-title":["Proceedings of the fourteenth ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482591","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2492002.2482591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:11Z","timestamp":1750235951000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482591"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":18,"alternative-id":["10.1145\/2492002.2482591","10.1145\/2492002"],"URL":"https:\/\/doi.org\/10.1145\/2492002.2482591","relation":{},"subject":[],"published":{"date-parts":[[2013,6,16]]},"assertion":[{"value":"2013-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}