Fair Package Assignment
MetadataShow full item record
CitationLahaie, Sébastien and David C. Parkes. 2009. Fair package assignment. In Auctions, Market Mechanisms and Their Applications. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 14, ed. S. Das, M. Ostrovsky, D. Pennock and B. Szymanksi, 92. Berlin; New York: Springer Berlin Heidelberg.
AbstractWe consider the problem of fair allocation in the package assignment model, where a set of indivisible items, held by single seller, must be efficiently allocated to agents with quasi-linear utilities. A fair assignment is one that is efficient and envy-free. We consider a model where bidders have superadditive valuations, meaning that items are pure complements. Our central result is that core outcomes are fair and even coalition-fair over this domain, while fair distributions may not even exist for general valuations. Of relevance to auction design, we also establish that the core is equivalent to the set of anonymous-price competitive equilibria, and that superadditive valuations are a maximal domain that guarantees the existence of anonymous-price competitive equilibrium. Our results are analogs of core equivalence results for linear prices in the standard assignment model, and for nonlinear, non-anonymous prices in the package assignment model with general valuations.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:3967320
- FAS Scholarly Articles