Please use this identifier to cite or link to this item:
Lerner, Anat
Gonen, Rica
Year of Publication: 
[Journal:] Games [ISSN:] 2073-4336 [Publisher:] MDPI [Place:] Basel [Volume:] 5 [Year:] 2014 [Issue:] 2 [Pages:] 97-115
We characterize the efficiency space of deterministic, dominant-strategy incentive compatible, individually rational and Pareto-optimal combinatorial auctions in a model with two players and k nonidentical items. We examine a model with multidimensional types, private values and quasilinear preferences for the players with one relaxation: one of the players is subject to a publicly known budget constraint. We show that if it is publicly known that the valuation for the largest bundle is less than the budget for at least one of the players, then Vickrey-Clarke-Groves (VCG) uniquely fulfills the basic properties of being deterministic, dominant-strategy incentive compatible, individually rational and Pareto optimal. Our characterization of the efficient space for deterministic budget constrained combinatorial auctions is similar in spirit to that of Maskin 2000 for Bayesian single-item constrained efficiency auctions and comparable with Ausubel and Milgrom 2002 for non-constrained combinatorial auctions.
budget constraints
Pareto efficiency
incentive compatibility
Persistent Identifier of the first edition: 
Creative Commons License:
Document Type: 
Appears in Collections:

Files in This Item:
238.59 kB

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.