On the Hardness of Being Truthful (2008)

by Christos Papadimitriou , Michael Schapira , Yaron Singer
Venue:In 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS
Citations:29 - 3 self

Documents Related by Co-Citation

72 Truthful and near-optimal mechanism design via linear programming – Ron Lavi, Chaitanya Swamy - 2005
480 Algorithmic mechanism design – Noam Nisan, Amir Ronen - 1999
66 Truthful randomized mechanisms for combinatorial auctions – Shahar Dobzinski, Noam Nisan, Michael Schapira - 2006
954 Counterspeculation, Auctions, and Competitive Sealed Tenders – William Vickrey - 1961
97 Towards a characterization of truthful combinatorial auctions – Ron Lavi, Noam Nisan - 2003
11 Inapproximability for vcg-based combinatorial auctions – Dave Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos Papadimitriou, Michael Schapira, Yaron Singer, Chris Umans
659 Optimal Auction Design – R B Myerson - 1981
556 Multipart pricing of public goods – E H CLARKE - 1971
77 Approximation algorithms for combinatorial auctions with complement-free bidders – Shahar Dobzinski, Noam Nisan, Michael Schapira - 2005
162 Truth revelation in approximately efficient combinatorial auctions – Daniel Lehmann - 2002
10 Black-Box Randomized Reductions in Algorithmic Mechanism Design – Shaddin Dughmi, Tim Roughgarden
16 Bayesian algorithmic mechanism design – Jason D. Hartline, Brendan Lucier - 2010
13 Single-value combinatorial auctions and algorithmic implementation in undominated strategies – M Babaioff, R Lavi, E Pavlov - 2009
50 Introduction to Mechanism Design (for Computer Scientists) – Noam Nisan
150 Truthful Mechanisms for One-Parameter Agents – Aron Archer, Eva Tardos
441 Incentives in Teams – T GROVES - 1973
182 Algorithmic Game Theory – Tim Roughgarden - 2009
108 Combinatorial Auctions with Decreasing Marginal Utilities – Benny Lehmann, Daniel Lehmann, Noam Nisan - 2001
252 An analysis of the approximations for maximizing submodular set functions – G Nemhauser, L Wosley, M Fisher - 1978