English

The second-price auction solves King Solomon's dilemma

Computer Science and Game Theory 2011-07-05 v1

Abstract

The planner wants to give k identical, indivisible objects to the top k valuation agents at zero costs. 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 simple mechanism implements the desired outcome in iteratively undominated strategies. Moreover, no pair of agents can profitably deviate from the equilibrium by coordinating their strategies or bribing each other.

Keywords

Cite

@article{arxiv.1107.0433,
  title  = {The second-price auction solves King Solomon's dilemma},
  author = {H. Reiju Mihara},
  journal= {arXiv preprint arXiv:1107.0433},
  year   = {2011}
}

Comments

12 pages;To appear in Japanese Economic Review

R2 v1 2026-06-21T18:31:09.991Z