This paper studies the possibility of implementing Pareto optimal outcomes in the combinatorial auction setting where bidders may have budget constraints. I show that when the setting involves a single good, or multiple goods but with single-minded bidders, there is a unique mechanism, called...

We analyze the space of deterministic, dominant-strategy incentive compatible, individually rational and Pareto optimal combinatorial auctions. We examine a model with multidimensional types, nonidentical items, private values and quasilinear preferences for the players with one relaxation; the...

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

Consider a first-price, sealed-bid auction with interdependent valuations and private budget constraints. Focusing on the two-bidder case, we identify new sufficient conditions for the existence of a symmetric equilibrium in pure strategies. In equilibrium, agents may adopt discontinuous bidding...