{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:19:18Z","timestamp":1740097158265,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662484326"},{"type":"electronic","value":"9783662484333"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48433-3_7","type":"book-chapter","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T07:07:03Z","timestamp":1443078423000},"page":"85-97","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Money Burning in General Domains"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris","family":"Tsipras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Tzamos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanouil","family":"Zampetakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,10]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Frugal path mechanisms. ACM Transactions on Algorithms 3(1) (2007)","DOI":"10.1145\/1219944.1219948"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Braverman, M., Chen, J., Kannan, S.: Optimal provision-after-wait in healthcare. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science (ITCS 2014), pp. 541\u2013542 (2014)","DOI":"10.1145\/2554797.2554846"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Cavallo, R.: Efficiency and redistribution in dynamic mechanism design. In: Proceedings of the 9th ACM Conference on Electronic Commerce (EC 2008), pp. 220\u2013229 (2008)","DOI":"10.1145\/1386790.1386826"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Chakravarty, S., Kaplan, T.R.: Manna from heaven or forty years in the desert: optimal allocation without transfer payments. Social Science Research Network (2006). \n                      http:\/\/dx.doi.org\/10.2139\/ssrn.939389","DOI":"10.2139\/ssrn.939389"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Cole, R., Gkatzelis, V., Goel, G.: Mechanism design for fair division: allocating divisible items without payments. In: Proceedings of the 14th ACM Conference on Electronic Commerce (EC 2013), pp. 251\u2013268 (2013)","DOI":"10.1145\/2492002.2482582"},{"key":"7_CR6","unstructured":"Elkind, E., Sahai, A., Steiglitz, K.: Frugality in path auctions. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 701\u2013709 (2004)"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0165-1765(99)00115-9","volume":"65","author":"P Eso","year":"1999","unstructured":"Eso, P., Futo, G.: Auction design with a risk averse seller. Economics Letters 65(1), 71\u201374 (1999)","journal-title":"Economics Letters"},{"issue":"477","key":"7_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1198\/016214506000001437","volume":"102","author":"T Gneiting","year":"2007","unstructured":"Gneiting, T., Rafterys, A.E.: Strictly proper scoring rules, prediction, and estimation. J. Am. Stat. Assoc. 102(477), 359\u2013378 (2007)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.geb.2008.06.007","volume":"67","author":"M Guo","year":"2009","unstructured":"Guo, M., Conitzer, V.: Worst-case optimal redistribution of VCG payments in multi-unit auctions. Games Econ. Behav. 67(1), 69\u201398 (2009)","journal-title":"Games Econ. Behav."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.artint.2014.07.006","volume":"216","author":"M Guo","year":"2014","unstructured":"Guo, M., Conitzer, V.: Better redistribution with inefficient allocation in multi-unit auctions. Artif. Intell. 216, 287\u2013308 (2014)","journal-title":"Artif. Intell."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Roughgarden, T.: Optimal mechanism design and money burning. In: Proceedings of the 40th ACM Symposium on Theory of Computing (STOC 2008), pp. 75\u201384 (2008)","DOI":"10.1145\/1374376.1374390"},{"key":"7_CR12","unstructured":"Lesca, J., Todo, T., Yokoo, M.: Coexistence of utilitarian efficiency and false-name-proofness in social choice. In: International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2014), pp. 1201\u20131208 (2014)"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R Myerson","year":"1981","unstructured":"Myerson, R.: Optimal auction design. Math. Oper. Res. 6(1), 58\u201373 (1981)","journal-title":"Math. Oper. Res."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1017\/CBO9780511800481.011","volume":"9","author":"N Nisan","year":"2007","unstructured":"Nisan, N.: Introduction to mechanism design (for computer scientists). Algorithmic Game Theor. 9, 209\u2013242 (2007)","journal-title":"Algorithmic Game Theor."},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-92185-1_41","volume-title":"Internet and Network Economics","author":"M Schapira","year":"2008","unstructured":"Schapira, M., Singer, Y.: Inapproximability of combinatorial public projects. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 351\u2013361. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48433-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T21:29:41Z","timestamp":1559251781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48433-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662484326","9783662484333"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48433-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}