{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:31:32Z","timestamp":1725456692212},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642353109"},{"type":"electronic","value":"9783642353116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35311-6_10","type":"book-chapter","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T07:32:28Z","timestamp":1354606348000},"page":"128-141","source":"Crossref","is-referenced-by-count":0,"title":["Funding Games: The Truth but Not the Whole Truth"],"prefix":"10.1007","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[]},{"given":"Yi","family":"Gai","sequence":"additional","affiliation":[]},{"given":"Matthew P.","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Bhaskar","family":"Krishnamachari","sequence":"additional","affiliation":[]},{"given":"George","family":"Rabanca","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Fischer, F., Procaccia, A., Tennenholtz, M.: Sum of us: strategyproof selection from the selectors. In: TARK (2011)","DOI":"10.1145\/2000378.2000390"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Fischer, F., Kash, I., Procaccia, A.D.: Mix and match. In: EC (2010)","DOI":"10.1145\/1807342.1807392"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.jcss.2008.10.001","volume":"75","author":"V. Auletta","year":"2009","unstructured":"Auletta, V., De Prisco, R., Penna, P., Persiano, G.: The power of verification for one-parameter agents. J. Comput. Syst. Sci.\u00a075, 190\u2013211 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/11786986_52","volume-title":"Automata, Languages and Programming","author":"V. Auletta","year":"2006","unstructured":"Auletta, V., De Prisco, R., Penna, P., Persiano, G., Ventre, C.: New Constructions of Mechanisms with Verification. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 596\u2013607. Springer, Heidelberg (2006)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Blumrosen, L., Nisan, N.: Auctions with severely bounded communication. In: FOCS (2002)","DOI":"10.1007\/978-3-540-39658-1_12"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-540-39658-1_12","volume-title":"Algorithms - ESA 2003","author":"L. Blumrosen","year":"2003","unstructured":"Blumrosen, L., Nisan, N., Segal, I.: Multi-player and Multi-round Auctions with Severely Bounded Communication. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 102\u2013113. Springer, Heidelberg (2003)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation techniques for utilitarian mechanism design. In: STOC (2005)","DOI":"10.1145\/1060590.1060597"},{"key":"10_CR8","unstructured":"Chen, N., Gravin, N., Lu, P.: Mechanism design without money via stable matching. CoRR (2011)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, W., Sandholm, T.: Partial-revelation vcg mechanism for combinatorial auctions. In: AAAI (2002)","DOI":"10.1007\/3-540-36378-5_3"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N.: Mechanisms for multi-unit auctions. In: EC (2007)","DOI":"10.1145\/1250910.1250960"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N.: Multi-unit auctions: beyond roberts. In: EC (2011)","DOI":"10.1145\/1993574.1993611"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Ghosh, A.: Truthful assignment without money. In: EC (2010)","DOI":"10.1145\/1807342.1807394"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1016\/j.tcs.2008.12.024","volume":"410","author":"A. Ferrante","year":"2009","unstructured":"Ferrante, A., Parlato, G., Sorrentino, F., Ventre, C.: Fast payment schemes for truthful mechanisms with verification. Theor. Comput. Sci.\u00a0410, 886\u2013899 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR14","unstructured":"Guo, M., Conitzer, V.: Strategy-proof allocation of multiple items between two agents without payments or priors. In: AAMAS (2010)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer (2004)","DOI":"10.1007\/978-3-540-24777-7"},{"key":"10_CR16","unstructured":"Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. In: FOCS (2005)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Lu, P., Sun, X., Wang, Y., Zhu, Z.A.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: EC (2010)","DOI":"10.1145\/1807342.1807393"},{"key":"10_CR18","unstructured":"Mu\u2019alem, A., Nisan, N.: Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract. In: Eighteenth National Conference on Artificial Intelligence (2002)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behavior (2001)","DOI":"10.1006\/game.1999.0790"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1007\/978-3-540-87744-8_59","volume-title":"Algorithms - ESA 2008","author":"P. Penna","year":"2008","unstructured":"Penna, P., Ventre, C.: Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 708\u2013719. Springer, Heidelberg (2008)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: EC (2009)","DOI":"10.1145\/1566374.1566401"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy in games of incomplete information. SIGecom Exch. 11(1) (June 2012)","DOI":"10.1145\/2325713.2325716"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11944874_5","volume-title":"Internet and Network Economics","author":"C. Ventre","year":"2006","unstructured":"Ventre, C.: Mechanisms with Verification for Any Finite Domain. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 37\u201349. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35311-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T13:50:30Z","timestamp":1557409830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35311-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353109","9783642353116"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35311-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}