Abstract
Finding an optimal mechanism in a standard adverse selection model is equivalent to solving an infinite dimensional linear program. We begin with certain feasible mechanisms-those implemented by auctions, take-it-or-leave-it offers, and combinations of these polar mechanisms-and search for the environments that make them optimal. We prove the optimality of each mechanism using the dual program.
Original language | English (US) |
---|---|
Pages (from-to) | 411-428 |
Number of pages | 18 |
Journal | Journal of Mathematical Economics |
Volume | 40 |
Issue number | 3-4 |
DOIs | |
State | Published - Jun 2004 |
Keywords
- Auctions
- Bargaining
- Duality
- Linear programming
- Mechanism design
- Procurement
ASJC Scopus subject areas
- Economics and Econometrics
- Applied Mathematics