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

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 bidders are single-minded, there is a unique mechanism, called truncation VCG, that is individually rational, incentive...

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

A given set of users share the submodular cost of access to a network (or, more generally, the submodular cost of any idiosyncratic binary good). We compare strategyproof mechanisms that serve the efficient set of users (but do not necessarily balance the budget) with those that exactly cover...

We consider optional TOU (time-of-use) pricing for residential consumers as an alternative to a single TOU or flat rate structure offered by a publicly regulated electricity supplier. A general equilibrium model is developed and used to explore and quantify the effects of optional pricing on...

This paper examines the set of Pareto efficient allocations in a finite period Mirrlees (1971, 1976) economy; each period represents a lifetime for an agent who cares about the utility of his descendants. In making Pareto comparisons, we use an interim concept of efficiency, and consider an...