Find out how to access preview-only content
Volume 5814 of the series Lecture Notes in Computer Science pp 14-23
A Modular Approach to Roberts’ Theorem
- Shahar DobzinskiAffiliated withThe School of Computer Science and Engineering, The Hebrew University of Jerusalem
- , Noam NisanAffiliated withThe School of Computer Science and Engineering, The Hebrew University of JerusalemGoogle Tel Aviv
Abstract
Roberts’ theorem from 1979 states that the only incentive compatible mechanisms over a full domain and range of at least 3 are weighted variants of the VCG mechanism termed affine maximizers. Roberts’ proof is somewhat “magical” and we provide a new “modular” proof. We hope that this proof will help in future efforts to extend the theorem to non-full domains such as combinatorial auctions or scheduling.
- Title
- A Modular Approach to Roberts’ Theorem
- Book Title
- Algorithmic Game Theory
- Book Subtitle
- Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings
- Pages
- pp 14-23
- Copyright
- 2009
- DOI
- 10.1007/978-3-642-04645-2_3
- Print ISBN
- 978-3-642-04644-5
- Online ISBN
- 978-3-642-04645-2
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- 5814
- Series ISSN
- 0302-9743
- Publisher
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Topics
- Industry Sectors
- eBook Packages
- Editors
-
- Marios Mavronicolas (16)
- Vicky G. Papadopoulou (17)
- Editor Affiliations
-
- 16. Department of Computer Science, University of Cyprus
- 17. Department of Computer Science and Engineering, European University Cyprus
- Authors
-
- Shahar Dobzinski (18)
- Noam Nisan (18) (19)
- Author Affiliations
-
- 18. The School of Computer Science and Engineering, The Hebrew University of Jerusalem,
- 19. Google Tel Aviv,
Continue reading...
To view the rest of this content please follow the download PDF link above.