Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12202/4017
Title: Optimal Allocation of an Indivisible Good.
Authors: Shao, Ran
Zhou, Lin
0000-0002-1736-9862
Keywords: Dominance incentive mechanisms
Average efficiency
Fixed-price mechanisms
Option mechanisms
Budget balance
Issue Date: Nov-2016
Publisher: Elsevier
Citation: Shao, Ran & Zhou, Lin. November 2016. Optimal allocation of an indivisible Good. Games and Economic Behavior.100, 95-112.
Abstract: In this paper, we consider the problem of allocating an indivisible good efficiently between two agents with monetary transfers. We focus on allocation mechanisms that are dominant-strategy incentive compatible when agents' types are private information. Inefficiency of an allocation mechanism may come from two sources: misallocation of the indivisible good and an imbalanced budget. Unfortunately, as Green and Laffont (1979) demonstrate, no allocation mechanism can always overcome both kinds of inefficiency. We identify allocation mechanisms that maximize the expected total utilities of agents, and characterize optimal mechanisms for a large class of agents' type distributions. For strongly regular type distributions, we show that the optimal mechanisms must be budget-balanced: they are either fixed-price mechanisms or option mechanisms. The result may not hold for other type distributions. For certain type distributions, we show that optimal mechanisms are hybrids of Vickrey–Clarke–Groves mechanisms and budget-balanced mechanisms.
Description: In this paper, we consider the problem of allocating an indivisible good efficiently between two agents when agents' valuations of the good are private information.
URI: https://doi.org/10.1016/j.geb.2016.09.004
https://hdl.handle.net/20.500.12202/4017
ISSN: 0899-8256
Appears in Collections:Sy Syms School of Business (SSSB) -- Faculty Publications

Files in This Item:
File Description SizeFormat 
Shao Zhou Nov2016 Optimal Allocation gebR4 Sep 5.pdf321.53 kBAdobe PDFThumbnail
View/Open


This item is licensed under a Creative Commons License Creative Commons