Skip to main content
Article thumbnail
Location of Repository

(0);:::; (n)2[0;1]

By Dino Gerardi and Leeat Yariv Y

Abstract

Consider a committee of size n: We look for the optimal mechanism under the restriction that all n players acquire information

Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.2780
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://sites.carloalberto.org/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.