{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T08:02:43Z","timestamp":1750492963511,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s00224-016-9720-2","type":"journal-article","created":{"date-parts":[[2016,11,6]],"date-time":"2016-11-06T18:32:17Z","timestamp":1478457137000},"page":"619-640","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Money Burning in General Domains"],"prefix":"10.1007","volume":"59","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6864-8960","authenticated-orcid":false,"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":[[2016,11,7]]},"reference":[{"key":"9720_CR1","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, E.: Frugal path mechanisms. ACM Trans. Algorithms 3(1) (2007)","DOI":"10.1145\/1186810.1186813"},{"key":"9720_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 \u201914), pp 541\u2013542 (2014)","DOI":"10.1145\/2554797.2554846"},{"key":"9720_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 \u201908), pp 220\u2013229 (2008)","DOI":"10.1145\/1386790.1386826"},{"key":"9720_CR4","author":"S Chakravarty","year":"2006","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). doi: 10.2139\/ssrn.939389","journal-title":"Social Science Research Network"},{"key":"9720_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 \u201913), pp 251\u2013268 (2013)","DOI":"10.1145\/2492002.2482582"},{"key":"9720_CR6","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Paes Leme, R.: Efficiency guarantees in auctions with budgets. In: Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP \u201914), vol. 8572, pp 392\u2013404. LNCS (2014)","DOI":"10.1007\/978-3-662-43948-7_33"},{"key":"9720_CR7","unstructured":"Elkind, E., Sahai, A., Steiglitz, K: Frugality in Path Auctions. In: Proceedings of the 15th ACM-SIAM, Symposium on Discrete Algorithms (SODA \u201904), pp 701\u2013709 (2004)"},{"issue":"1","key":"9720_CR8","doi-asserted-by":"crossref","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. Econ. Lett. 65 (1), 71\u201374 (1999)","journal-title":"Econ. Lett."},{"key":"9720_CR9","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Tsipras, D., Tzamos, C., Zampetakis, E.: Efficient Money Burning in General Domains. In: Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT \u201915), vol. 9347, pp 85\u201397. LNCS (2015)","DOI":"10.1007\/978-3-662-48433-3_7"},{"key":"9720_CR10","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Tzamos, C., Zampetakis, E.: Mechanism Design with Selective Verification. In: Proceedings of the 17th ACM Conference on Electronic Commerce (EC \u201916) (2016)","DOI":"10.1145\/2940716.2940743"},{"issue":"1","key":"9720_CR11","doi-asserted-by":"crossref","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 and Economic Behavior 67(1), 69\u201398 (2009)","journal-title":"Games and Economic Behavior"},{"key":"9720_CR12","doi-asserted-by":"crossref","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":"9720_CR13","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 \u201908), pp 75\u201384 (2008)","DOI":"10.1145\/1374376.1374390"},{"key":"9720_CR14","doi-asserted-by":"crossref","unstructured":"Huang, Z., Kannan, S.: The exponential mechanism for social welfare: private, truthful, and nearly optimal. In: Proceedings of the 53rd IEEE, Symposium on Foundations of Computer Science (FOCS \u201912), pp 140\u2013149 (2012)","DOI":"10.1109\/FOCS.2012.36"},{"key":"9720_CR15","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 \u201914), pp 1201\u20131208 (2014)"},{"issue":"1","key":"9720_CR16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.jet.2006.12.007","volume":"137","author":"AM Manelli","year":"2007","unstructured":"Manelli, A.M., Vincent, D.R.: multidimensional mechanism design revenue maximization and the Multiple-Good monopoly. J. Econ. Theory 137(1), 153\u2013185 (2007)","journal-title":"J. Econ. Theory"},{"key":"9720_CR17","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: Proceedings of the 48th IEEE, Symposium on Foundations of Computer Science (FOCS \u201907), pp 94\u2013103 (2007)","DOI":"10.1109\/FOCS.2007.66"},{"key":"9720_CR18","doi-asserted-by":"crossref","unstructured":"Mirrokni, V.S., Muthukrishnan, S., Nadav, U.: Quasi-proportional mechanisms: Prior-free revenue maximization. In: Proceedings of the 9th Latin American Symposium on Theoretical Informatics (LATIN \u201910), vol. 6034, pp 565\u2013576. LNCS (2010)","DOI":"10.1007\/978-3-642-12200-2_49"},{"issue":"1","key":"9720_CR19","doi-asserted-by":"crossref","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":"9720_CR20","doi-asserted-by":"crossref","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 Theory 9, 209\u2013242 (2007)","journal-title":"Algorithmic Game Theory"},{"key":"9720_CR21","doi-asserted-by":"crossref","unstructured":"Nissim, K., Smorodinsky, R., Tennenholtz, M.: Approximately optimal mechanism design via Differential Privacy. In: Proceedings of the 3rd Conference on Innovations in Theoretical Computer Science (ITCS \u201912), pp 203\u2013213 (2012)","DOI":"10.1145\/2090236.2090254"},{"key":"9720_CR22","first-page":"150","volume":"35","author":"J-C Rochet","year":"2003","unstructured":"Rochet, J.-C., Stole, L.A.: The Economics of Multidimensional Screening. Econometric Society Monographs 35, 150\u2013197 (2003)","journal-title":"Econometric Society Monographs"},{"key":"9720_CR23","doi-asserted-by":"crossref","unstructured":"Schapira, M., Singer, Y.: Inapproximability of Combinatorial Public Projects. In: Proceedings of the 4th Workshop on Internet and Network Economics (WINE \u201908), vol. 5385, pp 351\u2013361. LNCS (2008)","DOI":"10.1007\/978-3-540-92185-1_41"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9720-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-016-9720-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9720-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T22:57:47Z","timestamp":1498345067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-016-9720-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["9720"],"URL":"https:\/\/doi.org\/10.1007\/s00224-016-9720-2","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2016,11]]}}}