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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have