Abstract
Consider the problem of allocating k identical, indivisible objects among n agents, where k is less than n. The planner's objective is to give the objects to the top k valuation agents at zero costs to the planner and the agents. Each agent knows her own valuation of the object and whether it is among the top k. Modify the (k+1)st-price sealed-bid auction by introducing a small participation fee and the option not to participate in it. This strikingly simple mechanism (modified auction) implements the desired outcome in iteratively weakly undominated strategies. Moreover, no pair of agents can profitably deviate from the equilibrium by coordinating their strategies or bribing each other.
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call