{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,14]],"date-time":"2025-02-14T05:28:47Z","timestamp":1739510927855,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108402"},{"type":"electronic","value":"9783642108419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10841-9_41","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T17:14:44Z","timestamp":1260292484000},"page":"447-454","source":"Crossref","is-referenced-by-count":0,"title":["Refining the Cost of Cheap Labor in Set System Auctions"],"prefix":"10.1007","author":[{"given":"Ning","family":"Chen","sequence":"first","affiliation":[]},{"given":"Edith","family":"Elkind","sequence":"additional","affiliation":[]},{"given":"Nick","family":"Gravin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","unstructured":"Archer, A., Tardos, \u00c9.: Frugal Path Mechanisms. In: SODA 2002, pp. 991\u2013999 (2002)"},{"key":"41_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/978-3-540-30551-4_21","volume-title":"Algorithms and Computation","author":"G. Calinescu","year":"2004","unstructured":"Calinescu, G.: Bounding the Payment of Approximate Truthful Mechanisms. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 221\u2013233. Springer, Heidelberg (2004)"},{"key":"41_CR3","unstructured":"Chen, N., Karlin, A.R.: Cheap Labor Can Be Expensive. In: SODA 2007, pp. 707\u2013715 (2007)"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.: Failures of the VCG Mechanism in Combinatorial Auctions and Exchanges. In: AAMAS 2006, pp. 521\u2013528 (2006)","DOI":"10.1145\/1160633.1160729"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Elkind, E.: True Costs of Cheap Labor are Hard to Measure: Edge Deletion and VCG Payments in Graphs. In: EC 2005, pp. 108\u2013116 (2005)","DOI":"10.1145\/1064009.1064021"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Elkind, E., Goldberg, L.A., Goldberg, P.W.: Frugality Ratios and Improved Truthful Mechanisms for Vertex Cover. In: EC 2007, pp. 336\u2013345 (2007)","DOI":"10.1145\/1250910.1250959"},{"key":"41_CR7","unstructured":"Elkind, E., Sahai, A., Steiglitz, K.: Frugality in Path Auctions. In: SODA 2004, pp. 701\u2013709 (2004)"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Karger, D., Nikolova, E., Sami, R.: First-Price Path Auctions. In: EC 2005, pp. 203\u2013212 (2005)","DOI":"10.1145\/1064009.1064031"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Kempe, D., Tamir, T.: Beyond VCG: Frugality of Truthful Mechanisms. In: FOCS 2005, pp. 615\u2013626 (2005)","DOI":"10.1109\/SFCS.2005.25"},{"key":"41_CR10","volume-title":"Auction Theory","author":"V. Krishna","year":"2002","unstructured":"Krishna, V.: Auction Theory. Academic Press, London (2002)"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic Mechanism Design. In: STOC 1999, pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"key":"41_CR12","volume-title":"Matroid Theory","author":"J. Oxley","year":"1992","unstructured":"Oxley, J.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Sandholm, T.: Expressive Commerce and Its Application to Sourcing: How We Conducted $35 Billion of Generalized Combinatorial Auctions. In: ICEC 2007, pp. 349\u2013350 (2007)","DOI":"10.1145\/1282100.1282165"},{"key":"41_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1007\/3-540-36494-3_53","volume-title":"STACS 2003","author":"K. Talwar","year":"2003","unstructured":"Talwar, K.: The Price of Truth: Frugality in Truthful Mechanisms. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 608\u2013619. Springer, Heidelberg (2003)"}],"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-10841-9_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T18:10:18Z","timestamp":1739470218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10841-9_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108402","9783642108419"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10841-9_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}