{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T23:25:01Z","timestamp":1768433101411,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540006237","type":"print"},{"value":"9783540364948","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36494-3_53","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T17:12:04Z","timestamp":1269882724000},"page":"608-619","source":"Crossref","is-referenced-by-count":30,"title":["The Price of Truth: Frugality in Truthful Mechanisms"],"prefix":"10.1007","author":[{"given":"Kunal","family":"Talwar","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"key":"53_CR1","unstructured":"Lawrence M. Ausubel, \u201cAn Efficient Ascending-Bid Auction for Multiple Objects,\u201d Working Paper, University of Maryland, Department of Economics, 1997."},{"key":"53_CR2","doi-asserted-by":"crossref","unstructured":"Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit, \u201cLocal search heuristics for k-median and facility location problems\u201d, Proceedings of the 33rd ACM symposium on the theory of computing, 2001.","DOI":"10.1145\/380752.380755"},{"key":"53_CR3","doi-asserted-by":"crossref","unstructured":"Aaron Archer, Christos Papadimitriou, Kunal Talwar, \u00c9va Tardos, \u201cAn approximate truthful mechanism for combinatorial auctions with single parameter agents\u201d, To appear in SODA 2003","DOI":"10.1080\/15427951.2004.10129086"},{"key":"53_CR4","doi-asserted-by":"crossref","unstructured":"Aaron Archer, \u00c9va Tardos \u201cTruthful mechanisms for one-parameter agents\u201d,Proceedings of the 42nd IEEE annual symposium on Foundations of Computer Science, 2001.","DOI":"10.1109\/SFCS.2001.959924"},{"key":"53_CR5","unstructured":"Aaron Archer, \u00c9va Tardos \u201cFrugal Path Mechanisms\u201d, SODA 2002."},{"key":"53_CR6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-1-4684-9277-4_6","volume":"127","author":"S. Bikhchandani","year":"2001","unstructured":"Sushil Bikhchandani, Sven de Vries, James Schummer, Rakesh Vohra \u201cLinear Programming and Vickrey Auctions,\u201d IMA Volumes in Mathematics and its Applications, Mathematics of the Internet: E-Auction and Markets, 127:75\u2013116, 2001.","journal-title":"IMA Volumes in Mathematics and its Applications, Mathematics of the Internet: E-Auction and Markets"},{"key":"53_CR7","unstructured":"Sushil Bikhchandani, Joseph M. Ostroy, \u201cThe package assignment model\u201d, working paper, 2001."},{"key":"53_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"8","author":"E. H. Clarke","year":"1971","unstructured":"E. H. Clarke \u201cMultipart pricing of public goods\u201d, Public Choice, 8:17\u201333, 1971.","journal-title":"Public Choice"},{"key":"53_CR9","unstructured":"Edith Elkind, Amit Sahai, \u201cShortest Paths are costly\u201d, manuscript, October 2002."},{"key":"53_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jcss.2001.1754","volume":"63","author":"J. Feigenbaum","year":"2001","unstructured":"Joan Feigenbaum, Christos Papadimitriou, and Scott Shenker, \u201cSharing the cost of multicast transmissions\u201d, Journal of Computer and System Sciences 63:21\u201341, 2001.","journal-title":"Journal of Computer and System Sciences"},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"Theodore Groves \u201cIncentives in teams\u201d, Econometrica, 41(4):617\u2013631, 1973.","DOI":"10.2307\/1914085"},{"key":"53_CR12","unstructured":"Rahul Garg, Vijay Kumar, Atri Rudra and Akshat Verma, \u201cWhen can we devise frugal mechanisms for network design problems?\u201d, manuscript, 2002."},{"key":"53_CR13","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Philip Hall, \u201cOn representatives of subsets,\u201d Journal of London Mathematics Society, 10:26\u201330, 1935.","journal-title":"Journal of London Mathematics Society"},{"key":"53_CR14","unstructured":"Frank Harary, \u201cGraph Theory\u201d, Addison Wesley, 1971."},{"key":"53_CR15","unstructured":"John Hershberger, Subhash Suri, \u201c. Vickrey Pricing in network routing: Fast payment computation\u201d, Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, 2001."},{"key":"53_CR16","doi-asserted-by":"crossref","unstructured":"Daniel Lehmann, Liadan Ita O\u2019Callaghan, Yoav Shoham \u201cTruth revelation in rapid approximately efficient combinatorial auctions\u201d, 1st ACM conference on electronic commerce, 1999","DOI":"10.1145\/336992.337016"},{"key":"53_CR17","unstructured":"Ahuva Mu\u2019alem, Noam Nisan \u201cTruthful approximation mechanism for restricted combinatorial auctions\u201d, to appear in AAAI 2002"},{"key":"53_CR18","unstructured":"Andreu Mas-Colell, Michael D. Whinston, Jerry R. Green \u201c, Microeconomic Theory\u201d, Oxford University Press, 1995."},{"key":"53_CR19","doi-asserted-by":"crossref","unstructured":"Noam Nisan, Amir Ronen \u201cAlgorithmic mechanism design\u201d, Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999.","DOI":"10.1145\/301250.301287"},{"key":"53_CR20","doi-asserted-by":"crossref","unstructured":"Noam Nisan, Amir Ronen \u201cComputationally feasible VCG mechanisms\u201d, ACM conference on electronic commerce, 242\u2013252, 2000.","DOI":"10.1145\/352871.352898"},{"key":"53_CR21","volume-title":"A course in game theory","author":"M. J. Osborne","year":"1994","unstructured":"Martin J. Osborne, Ariel Rubinstein \u201cA course in game theory\u201d, MIT Press, Cambridge, 1994."},{"key":"53_CR22","doi-asserted-by":"crossref","unstructured":"Christos Papadimitriou \u201cAlgorithms, games and the Internet\u201d, Proceedings of the 33rd Annual ACM Symposium on Theory of Computation, 749\u2013753, 2001.","DOI":"10.1145\/380752.380883"},{"key":"53_CR23","unstructured":"David Parkes, Lyle Ungar, \u201cIterative Combinatorial Auctions: Theory and Practice\u201d, In Proc. 17th National Conference on Artificial Intelligence, (AAAI-00) pp. 74\u201381, 2000."},{"key":"53_CR24","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2977633","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"William Vickrey \u201cCounterspeculation, auctions and competitive sealed tenders\u201d, Journal of Finance, 16:8\u201337, 1961.","journal-title":"Journal of Finance"}],"container-title":["Lecture Notes in Computer Science","STACS 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36494-3_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T15:02:00Z","timestamp":1558969320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36494-3_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006237","9783540364948"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-36494-3_53","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}