This paper provides a characterization of dominant strategy mechanisms with quasi-linear utilities and multi-dimensional types for a variety of preference domains. These characterizations are in terms of a monotonicity property on the underlying allocation rule. -- Dominant Strategy ; Farkas...

We consider an environment with a single divisible good and two bidders. The valuations of the bidders are private information but one bidder has a commonly known budget constraint. For this environment we derive the revenue maximizing subsidy free incentive compatible auction. We also examine...

We examine the problem of allocating a resource repeatedly over time amongst a set of agents. The utility that each agent derives from consumption of the item is private information to that agent and, prior to consumption may be unknown to that agent. The problem is motivated by keyword...

We consider a dynamic auction problem motivated by the traditional single-leg, multi-period revenue management problem. A seller with C units to sell faces potential buyers with unit demand who arrive and depart over the course of T time periods. The time at which a buyer arrives, her value for...

We consider an environment where potential buyers of an indivisible good have liquidity constraints, in that they cannot pay more than their `budget' regardless of their valuation. A buyer's valuation for the good as well as her budget are her private information. We derive constrained-effcient...

We study a seller's optimal mechanism for maximizing revenue when the buyer may present evidence relevant to the buyer's value, or when different types of buyer have a differential ability to communicate. We introduce a dynamic bargaining protocol in which the buyer first makes a sequence of...