{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T08:08:13Z","timestamp":1746778093001,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T00:00:00Z","timestamp":1451347200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M018113\/1"],"award-info":[{"award-number":["EP\/M018113\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/K01000X\/1"],"award-info":[{"award-number":["EP\/K01000X\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00453-015-0105-8","type":"journal-article","created":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T14:07:20Z","timestamp":1451398040000},"page":"756-785","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Combinatorial Auctions Without Money"],"prefix":"10.1007","volume":"77","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Krysta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,29]]},"reference":[{"key":"105_CR1","doi-asserted-by":"crossref","unstructured":"Borodin, A., Lucier, B.: On the limitations of greedy mechanism design for truthful combinatorial auctions. In: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6\u201310, 2010, Proceedings, Part I, pp. 90\u2013101 (2010)","DOI":"10.1007\/978-3-642-14165-2_9"},{"issue":"4","key":"105_CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s00453-003-1036-3","volume":"37","author":"A Borodin","year":"2003","unstructured":"Borodin, A., Nielsen, M.N., Rackoff, C.: (Incremental) priority algorithms. Algorithmica 37(4), 295\u2013326 (2003)","journal-title":"Algorithmica"},{"issue":"6","key":"105_CR3","doi-asserted-by":"crossref","first-page":"1587","DOI":"10.1137\/090772988","volume":"40","author":"P Briest","year":"2011","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation techniques for utilitarian mechanism design. SIAM J. Comput. 40(6), 1587\u20131622 (2011)","journal-title":"SIAM J. Comput."},{"key":"105_CR4","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Elkind, E., Szegedy, M., Yu, L.: Mechanism design: from partial to probabilistic verification. In: ACM Conference on Electronic Commerce, pp. 266\u2013283 (2012)","DOI":"10.1145\/2229012.2229035"},{"issue":"2","key":"105_CR5","doi-asserted-by":"crossref","first-page":"661","DOI":"10.3982\/ECTA9454","volume":"80","author":"G Carroll","year":"2012","unstructured":"Carroll, G.: When are local incentive constraints sufficient? Econometrica 80(2), 661\u2013686 (2012)","journal-title":"Econometrica"},{"issue":"1","key":"105_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.geb.2005.05.005","volume":"56","author":"G Celik","year":"2006","unstructured":"Celik, G.: Mechanism design with weaker incentive compatibility constraints. Games Econ. Behav. 56(1), 37\u201344 (2006)","journal-title":"Games Econ. Behav."},{"key":"105_CR7","doi-asserted-by":"crossref","unstructured":"Dobzinski, S.: Two randomized mechanisms for combinatorial auctions. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20\u201322, 2007, Proceedings, pp. 89\u2013103 (2007)","DOI":"10.1007\/978-3-540-74208-1_7"},{"key":"105_CR8","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Ghosh, A.: Truthful assignment without money. In: Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, June 7\u201311, 2010, pp. 325\u2013334 (2010)","DOI":"10.1145\/1807342.1807394"},{"key":"105_CR9","unstructured":"Elkind, E., Sahai, A., Steiglitz, K.: Frugality in path auctions. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11\u201314, 2004, pp. 701\u2013709 (2004)"},{"key":"105_CR10","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.tcs.2012.11.036","volume":"472","author":"D Fotakis","year":"2013","unstructured":"Fotakis, D., Tzamos, C.: Winner-imposing strategyproof mechanisms for multiple facility location games. Theor. Comput. Sci. 472, 90\u2013103 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"105_CR11","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/2790086","volume":"3","author":"D Fotakis","year":"2015","unstructured":"Fotakis, D., Zampetakis, E.: Truthfulness flooded domains and the power of verification for mechanism design. ACM Trans. Econ. Comput. 3(4), 20 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"4","key":"105_CR12","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1137\/130913602","volume":"43","author":"F Grandoni","year":"2014","unstructured":"Grandoni, F., Krysta, P., Leonardi, S., Ventre, C.: Utilitarian mechanism design for multiobjective optimization. SIAM J. Comput. 43(4), 1263\u20131290 (2014)","journal-title":"SIAM J. Comput."},{"key":"105_CR13","doi-asserted-by":"crossref","first-page":"447","DOI":"10.2307\/2297639","volume":"53","author":"JR Green","year":"1986","unstructured":"Green, J.R., Laffont, J.: Partially verifiable information and mechanism design. Rev. Econ. Stud. 53, 447\u2013456 (1986)","journal-title":"Rev. Econ. Stud."},{"issue":"1","key":"105_CR14","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E Hazan","year":"2006","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Comput. Complex. 15(1), 20\u201339 (2006)","journal-title":"Comput. Complex."},{"key":"105_CR15","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/S0899-8256(03)00184-2","volume":"47","author":"R Holzman","year":"2004","unstructured":"Holzman, R., Kfir-Dahav, N., Monderer, D., Tennenholtz, M.: Bundling equilibrium in combinatorial auctions. Games Econ. Behav. 47, 104\u2013123 (2004)","journal-title":"Games Econ. Behav."},{"issue":"3","key":"105_CR16","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s00224-013-9473-0","volume":"54","author":"E Koutsoupias","year":"2014","unstructured":"Koutsoupias, E.: Scheduling without payments. Theory Comput. Syst. 54(3), 375\u2013387 (2014)","journal-title":"Theory Comput. Syst."},{"key":"105_CR17","doi-asserted-by":"crossref","unstructured":"Krysta, P.: Greedy approximation via duality for packing, combinatorial auctions and routing. In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29\u2013September 2, 2005, Proceedings, pp. 615\u2013627 (2005)","DOI":"10.1007\/11549345_53"},{"key":"105_CR18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.tcs.2015.01.001","volume":"571","author":"P Krysta","year":"2015","unstructured":"Krysta, P., Ventre, C.: Combinatorial auctions with verification are tractable. Theor. Comput. Sci. 571, 21\u201335 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"105_CR19","unstructured":"Krysta, P., V\u00f6cking, B.: Online mechanism design (randomized rounding on the fly). In: Automata, Languages, and Programming\u201439th International Colloquium, ICALP 2012, Warwick, UK, July 9\u201313, 2012, Proceedings, Part II, pp. 636\u2013647 (2012)"},{"issue":"5","key":"105_CR20","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"DJ Lehmann","year":"2002","unstructured":"Lehmann, D.J., O\u2019Callaghan, L., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. J. ACM 49(5), 577\u2013602 (2002)","journal-title":"J. ACM"},{"key":"105_CR21","doi-asserted-by":"crossref","unstructured":"Lu, P., Sun, X., Wang, Y., Zhu, Z.A.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, June 7\u201311, 2010, pp. 315\u2013324 (2010)","DOI":"10.1145\/1807342.1807393"},{"issue":"6","key":"105_CR22","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.2307\/1913518","volume":"52","author":"J Moore","year":"1984","unstructured":"Moore, J.: Global incentive constraints in auction design. Econometrica 52(6), 1523\u20131535 (1984)","journal-title":"Econometrica"},{"issue":"2","key":"105_CR23","doi-asserted-by":"crossref","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 Econ. Behav. 64(2), 612\u2013631 (2008)","journal-title":"Games Econ. Behav."},{"key":"105_CR24","doi-asserted-by":"crossref","unstructured":"Nisan, N.: The communication complexity of approximate set packing and covering. In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8\u201313, 2002, Proceedings, pp. 868\u2013875 (2002)","DOI":"10.1007\/3-540-45465-9_74"},{"key":"105_CR25","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games Econ. Behav. 35, 166\u2013196 (2001)","journal-title":"Games Econ. Behav."},{"key":"105_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)"},{"key":"105_CR27","doi-asserted-by":"crossref","unstructured":"Nissim, K., Smorodinsky, R., Tennenholtz, M.: Approximately optimal mechanism design via differential privacy. In: Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, January 8\u201310, 2012, pp. 203\u2013213 (2012)","DOI":"10.1145\/2090236.2090254"},{"issue":"2","key":"105_CR28","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/2189778.2189781","volume":"4","author":"P Penna","year":"2012","unstructured":"Penna, P., Ventre, C.: Collusion-resistant mechanisms with verification yielding optimal solutions. ACM Trans. Comput. Theory 4(2), 6 (2012)","journal-title":"ACM Trans. Comput. Theory"},{"key":"105_CR29","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.geb.2012.09.002","volume":"86","author":"P Penna","year":"2014","unstructured":"Penna, P., Ventre, C.: Optimal collusion-resistant mechanisms with verification. Games Econ. Behav. 86, 491\u2013509 (2014)","journal-title":"Games Econ. Behav."},{"issue":"4","key":"105_CR30","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/2542174.2542175","volume":"1","author":"AD Procaccia","year":"2013","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. ACM Trans. Econ. Comput. 1(4), 18 (2013)","journal-title":"ACM Trans. Econ. Comput."},{"key":"105_CR31","doi-asserted-by":"crossref","first-page":"597","DOI":"10.3982\/TE1129","volume":"10","author":"I Sher","year":"2015","unstructured":"Sher, I., Vohra, R.: Price discrimination through communication. Theor. Econ. 10, 597\u2013648 (2015)","journal-title":"Theor. Econ."},{"issue":"1","key":"105_CR32","first-page":"63","volume":"6","author":"N Singh","year":"2001","unstructured":"Singh, N., Wittman, D.: Implementation with partial verification. Rev. Econ. Des. 6(1), 63\u201384 (2001)","journal-title":"Rev. Econ. Des."},{"key":"105_CR33","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511835216","volume-title":"Mechanism Design: A Linear Programming Approach","author":"RV Vohra","year":"2011","unstructured":"Vohra, R.V.: Mechanism Design: A Linear Programming Approach. Cambridge University Press, Cambridge (2011)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0105-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0105-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0105-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0105-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:22Z","timestamp":1559072842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0105-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,29]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["105"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0105-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2015,12,29]]}}}