{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:28:23Z","timestamp":1725564503527},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207795"},{"type":"electronic","value":"9783540246183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24618-3_32","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T11:31:03Z","timestamp":1283686263000},"page":"373-384","source":"Crossref","is-referenced-by-count":0,"title":["Fully Truthful Mechanisms"],"prefix":"10.1007","author":[{"given":"Ning","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Archer, A., Tardos, E.: Frugal Path Mechanisms. In: SODA, pp. 991\u2013999 (2002)","key":"32_CR1"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"E.H. Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice\u00a011, 17\u201333 (1971)","journal-title":"Public Choice"},{"doi-asserted-by":"crossref","unstructured":"de Vries, S., Vohra, R.: Combinatorial Auctions: A Survry. INFORMS Journal on Computing (forthcoming)","key":"32_CR3","DOI":"10.1287\/ijoc.15.3.284.16077"},{"doi-asserted-by":"crossref","unstructured":"Feigebaum, J., Papadimitriou, C.H., Shenker, S.: Sharing the Cost of Multicast Transmissions. In: STOC, pp. 218\u2013227 (2000)","key":"32_CR4","DOI":"10.1145\/335305.335332"},{"doi-asserted-by":"crossref","unstructured":"Fiat, A., Goldberg, A.V., Hartline, J.D., Karlin, A.R.: Competitive Generalized Auctions. In: STOC, pp. 72\u201381 (2002)","key":"32_CR5","DOI":"10.1145\/509907.509921"},{"doi-asserted-by":"crossref","unstructured":"Green, J., Laffont, J.J.: Characterization of Satisfactory Mechanism for the Revelation of Preferences for Public Goods. Econometrica, 427\u2013438 (1977)","key":"32_CR6","DOI":"10.2307\/1911219"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T. Groves","year":"1973","unstructured":"Groves, T.: Incentives in Teams. Econometrica\u00a041, 617\u2013631 (1973)","journal-title":"Econometrica"},{"doi-asserted-by":"crossref","unstructured":"Lehmann, D., O\u2019Callaghan, L., Shoham, Y.: Truth Revelation in Rapid, Approximately Efficient Combinatorial Auctions. In: ACM Conference on E-Commerce (EC), pp. 96\u2013102 (1999)","key":"32_CR8","DOI":"10.1145\/336992.337016"},{"key":"32_CR9","volume-title":"Microeconomic Theory","author":"A. Mas-Collel","year":"1995","unstructured":"Mas-Collel, A., Whinston, W., Green, J.: Microeconomic Theory. Oxford University Press, Oxford (1995)"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R.B. Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal Auction Design. Mathematics of Operation Research\u00a06, 58\u201373 (1981)","journal-title":"Mathematics of Operation Research"},{"doi-asserted-by":"crossref","unstructured":"Nisan, N.: Bidding and Allocation in Combinatorial Auctions. In: ACM Conference on E-Commerce (EC), pp. 1\u201312 (2000)","key":"32_CR11","DOI":"10.1145\/352871.352872"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49116-3_1","volume-title":"STACS 99","author":"N. Nisan","year":"1999","unstructured":"Nisan, N.: Algorithms for Selfish Agents. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 1\u201315. Springer, Heidelberg (1999)"},{"unstructured":"Nisan, N., Ronen, A.: Algorithmic Mechanism Design (Extended Abstract). In: STOC, pp. 129\u2013140 (1999), Full version appeared in Game and Economic Behavior 35, pp. 166\u2013196 (2001)","key":"32_CR13"},{"key":"32_CR14","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubistein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, Games, and the Internet. In: STOC, pp. 749\u2013753 (2001)","key":"32_CR15","DOI":"10.1145\/380752.380883"},{"unstructured":"Ronen, A., Saberi, A.: Optimal Auctions are Hard. In: FOCS, pp. 396\u2013405 (2002)","key":"32_CR16"},{"doi-asserted-by":"crossref","unstructured":"Segal, I.R.: Optimal Pricing Mechanisms with Unknown Demand. Working paper (2002)","key":"32_CR17","DOI":"10.2139\/ssrn.297674"},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2977633","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance\u00a016, 8\u201337 (1961)","journal-title":"Journal of Finance"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2004: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24618-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T17:36:19Z","timestamp":1559583379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24618-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540207795","9783540246183"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24618-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}