{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:50:38Z","timestamp":1760298638218,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"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_33","type":"book-chapter","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T07:32:28Z","timestamp":1354606348000},"page":"448-461","source":"Crossref","is-referenced-by-count":6,"title":["Truthful Mechanism Design for Multidimensional Covering Problems"],"prefix":"10.1007","author":[{"given":"Hadi","family":"Minooei","sequence":"first","affiliation":[]},{"given":"Chaitanya","family":"Swamy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Frugal path mechanisms. ACM TALG\u00a03(1) (2007)","DOI":"10.1145\/1186810.1186813"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Dobzinski, S., Lavi, R.: An optimal lower bound for anonymous scheduling mechanisms. In: Proceedings of the 10th EC, pp. 169\u2013176 (2009)","DOI":"10.1145\/1566374.1566399"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation techniques for utilitarian mechanism design. In: Proceedings of the 37th STOC, pp. 39\u201348 (2005)","DOI":"10.1145\/1060590.1060597"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"E. Clarke","year":"1971","unstructured":"Clarke, E.: Multipart pricing of public goods. Public Choice\u00a011, 17\u201333 (1971)","journal-title":"Public Choice"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Chen, N., Elkind, E., Gravin, N., Petrov, F.: Frugal mechanism design via spectral techniques. In: Proceedings of the 51st FOCS, pp. 755\u2013764 (2010)","DOI":"10.1109\/FOCS.2010.77"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Elkind, E., Goldberg, L., Goldberg, P.: Frugality ratios and improved truthful mechanisms for vertex cover. In: Proceedings of the 8th EC, pp. 336\u2013345 (2007)","DOI":"10.1145\/1250910.1250959"},{"issue":"1","key":"33_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dss.2004.08.004","volume":"39","author":"N. Devanur","year":"2005","unstructured":"Devanur, N., Mihail, M., Vazirani, V.: Strategyproof cost-sharing mechanisms for set cover and facility location games. Decision Supp. Syst.\u00a039(1), 11\u201322 (2005)","journal-title":"Decision Supp. Syst."},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Springer (August 2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-74208-1_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S. Dobzinski","year":"2007","unstructured":"Dobzinski, S.: Two Randomized Mechanisms for Combinatorial Auctions. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 89\u2013103. Springer, Heidelberg (2007)"},{"issue":"1","key":"33_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.jcss.2011.02.010","volume":"78","author":"S. Dobzinski","year":"2012","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Truthful randomized mechanisms for combinatorial auctions. J. Comput. Syst. Sci.\u00a078(1), 15\u201325 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Vondr\u00e1k, J.: The computational complexity of truthfulness in combinatorial auctions. In: Proceedings of the 13th EC, pp. 405\u2013422 (2012)","DOI":"10.1145\/2229012.2229044"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Roughgarden, T.: Black-box randomized reductions in algorithmic mechanism design. In: Proceedings of the 51st FOCS, pp. 775\u2013784 (2010)","DOI":"10.1109\/FOCS.2010.79"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Roughgarden, T., Yan, Q.: From convex optimization to randomized mechanisms: toward optimal combinatorial auctions. In: STOC, pp. 149\u2013158 (2011)","DOI":"10.1145\/1993636.1993657"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Vondr\u00e1k, J.: Limitations of Randomized Mechanisms for Combinatorial Auctions. In: Proceedings of the 52nd FOCS, pp. 502\u2013511 (2011)","DOI":"10.1109\/FOCS.2011.64"},{"issue":"4","key":"33_CR15","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(4), 617\u2013631 (1973)","journal-title":"Econometrica"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0016-0032(65)90340-6","volume":"279","author":"S. Hakimi","year":"1965","unstructured":"Hakimi, S.: On the degrees of the vertices of a directed graph. J. Franklin Inst.\u00a0279, 290\u2013308 (1965)","journal-title":"J. Franklin Inst."},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K. Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. JACM\u00a050, 795\u2013824 (2003)","journal-title":"JACM"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Karlin, A., Kempe, D., Tamir, T.: Frugality of Truthful Mechanisms. In: Proceedings of the 46th FOCS, pp. 615\u2013626 (2005)","DOI":"10.1109\/SFCS.2005.25"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Kempe, D., Salek, M., Moore, C.: Frugal and truthful auctions for vertex covers, flows and cuts. In: Proceedings of the 51st FOCS, pp. 745\u2013754 (2010)","DOI":"10.1109\/FOCS.2010.76"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Lavi, R., Mu\u2019alem, A., Nisan, N.: Towards a characterization of truthful combinatorial auctions. In: Proceedings of the 44th FOCS, pp. 574\u2013583 (2003)","DOI":"10.1109\/SFCS.2003.1238230"},{"issue":"6","key":"33_CR21","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/2049697.2049699","volume":"58","author":"R. Lavi","year":"2011","unstructured":"Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. Journal of the ACM\u00a058(6), 25 (2011)","journal-title":"Journal of the ACM"},{"issue":"1","key":"33_CR22","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.geb.2008.08.001","volume":"67","author":"R. Lavi","year":"2009","unstructured":"Lavi, R., Swamy, C.: Truthful mechanism design for multidimensional scheduling via cycle monotonicity. Games and Economic Behavior\u00a067(1), 99\u2013124 (2009)","journal-title":"Games and Economic Behavior"},{"key":"33_CR23","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01364272","volume":"174","author":"W. Mader","year":"1967","unstructured":"Mader, W.: Homomorphieeigenschaften und mittlere kantendichte von graphen. Mathematische Annalen\u00a0174, 265\u2013268 (1967)","journal-title":"Mathematische Annalen"},{"issue":"2","key":"33_CR24","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.geb.2007.12.009","volume":"64","author":"A. Mu\u2019alem","year":"2008","unstructured":"Mu\u2019alem, A., Nisan, N.: Truthful approximation mechanisms for restricted combinatorial auctions. Games and Economic Behavior\u00a064(2), 612\u2013631 (2008)","journal-title":"Games and Economic Behavior"},{"key":"33_CR25","doi-asserted-by":"crossref","unstructured":"Nisam, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press (September 2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"33_CR26","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","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","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35311-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T05:49:26Z","timestamp":1745387366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35311-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353109","9783642353116"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35311-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}