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 the identity of those k agents, as well as her...

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...