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

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.

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-e±cient...

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 rules that choose a location on a graph (e.g. a network of roads) based on the report of agents' symmetric, single-peaked preferences over points on that graph. We show that while a strategy-poof, onto rule is not necessarily dictatorial, the existence of a cycle on the graph grants...

We propose a framework for reconciling frequentist and subjectivist views of probability. In an environment with repeated trails we show that beliefs about the possible states of nature can be represented by probabilities. Second, these probabilities will correspond to long run frequencies. In...

An absorbing game is a repeated game where some of the action combinations are absorbing, in the sense that whenever they are played, there is a positive probability that the game terminates, and the players receive some terminal payoff at every future stage. We prove that every n-player...