{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T05:14:08Z","timestamp":1737695648718,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"},{"type":"electronic","value":"9783540771203"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77120-3_34","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:31:09Z","timestamp":1196940669000},"page":"377-389","source":"Crossref","is-referenced-by-count":1,"title":["Using Nash Implementation to Achieve Better Frugality Ratios"],"prefix":"10.1007","author":[{"given":"Chien-Chung","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Yang","family":"Kao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang-Yang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weizhao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: Proceedings of the 42nd IEEE symposium on Foundations of Computer Science, pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"34_CR2","unstructured":"Archer, A., Tardos, E.: Frugal path mechanisms. In: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 991\u2013999 (2002)"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Auletta, V., Prisco, R., Penna, P., Persiano, P.: Deterministic truthful approximation schemes for scheduling related machines. In: Proceedings of the 21st Symposium on Theoretical Aspects of Computer Science, Le Corum, Montpellier, France, pp. 608\u2013619 (March 2004)","DOI":"10.1007\/978-3-540-24749-4_53"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Clarke, E.H.: Multipart pricing of public goods. Public Choice, 17\u201333 (1971)","DOI":"10.1007\/BF01726210"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Groves, T.: Incentives in teams. Econometrica, 617\u2013631 (1973)","DOI":"10.2307\/1914085"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Huang, C.-C., Kao, M.-Y., Li, X.-Y., Wang, W.: Using nash implementation to achieve better frugality ratios. Technical Report TR2007-604, Computer Science Department, Dartmouth College (2007)","DOI":"10.1007\/978-3-540-77120-3_34"},{"key":"34_CR7","unstructured":"Immorlica, N.: Computing With Strategic Agents. PhD thesis, MIT (2005)"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Karger, D., Nikolova, E., Sami, R.: First-price path auctions. In: Proceedings of the 6th ACM Conference on Electronic Commerce, pp. 203\u2013212 (2005)","DOI":"10.1145\/1064009.1064031"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Kao, M.-Y., Li, X.-Y., Wang, W.: Towards truthful mechanisms for binary demand games: A general framework. In: Proceedings of the 6th ACM conference on Electronic Commerce, pp. 213\u2013222 (2005)","DOI":"10.1145\/1064009.1064032"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Karlin, A., Kempe, D., Tamir, T.: Beyond VCG: Frugality of truthful mechanisms. In: 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 615\u2013626 (2005)","DOI":"10.1109\/SFCS.2005.25"},{"issue":"5","key":"34_CR11","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"D. Lehmann","year":"2002","unstructured":"Lehmann, D., O\u2019callaghan, L.I., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. Journal of ACM\u00a049(5), 577\u2013602 (2002)","journal-title":"Journal of ACM"},{"key":"34_CR12","unstructured":"Mu\u2019alem, A., Nisan, N.: Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract. In: Proceedings of the 18th National Conference on Artificial Intelligence, pp. 379\u2013384 (2002)"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: Proceedings of the 31st Annual Symposium on Theory of Computing, pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Talwar, K.: The price of truth: Frugality in truthful mechanisms. In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, pp. 608\u2013619 (2003)","DOI":"10.1007\/3-540-36494-3_53"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Vickrey, W.: Counterspeculation, auctions and competitive sealed tenders. Journal of Finance, 8\u201337 (1961)","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T08:11:29Z","timestamp":1737619889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540771180","9783540771203"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}