A Modular Approach to Roberts’ Theorem

  • Shahar Dobzinski
  • Noam Nisan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5814)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Shahar Dobzinski
    • 1
  • Noam Nisan
    • 1
    • 2
  1. 1.The School of Computer Science and EngineeringThe Hebrew University of Jerusalem 
  2. 2.Google Tel Aviv 

Personalised recommendations