Abstract:
We consider a multi-awards generalization of King Solomon's problem: $k$ identical and indivisible awards should be distributed among $n$ agents, $k1)$ prizes efficiently in subgame perfect equilibria without any monetary transfers in equilibrium. Finally, in the multi-awards case we relax the complete information assumption and achieve implementation of efficient allocation by iterative elimination of weakly dominated strategies, using a generalization of Olszewski's (2003) mechanism
Keywords:Solomon's problem; prizes; implementation (search for similar items in EconPapers) JEL-codes:D78 (search for similar items in EconPapers) Date: 2004-08-11
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
More papers in Econometric Society 2004 North American Summer Meetings from Econometric Society Contact information at EDIRC. Series data maintained by Christopher F. Baum ().
This site is part of RePEc
and all the data displayed here is part of the RePEc data set.
Is your work missing from RePEc? Here is how to
contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .