We develop a network-flow approach for characterizing interim-allocation rules that can be implemented by ex post allocations. Our method can be used to characterize feasible interim allocations in general multi-unit auctions where agents face capacity constraints, both ceilings and floors....

We study the efficient allocation of a single object over a finite time horizon. Buyers arrive randomly over time, are long-lived, and have independent private values. The valuation of a buyer may depend on the time of the allocation in an arbitrary way. We construct an incentive compatible...

We study auction design in the standard symmetric independent private values environment, where the seller lacks the commitment power to withhold an unsold object off the market. The seller has a single object and can conduct an infinite sequence of standard auctions with reserve prices to...

This paper provides a tractable characterization of feasibility of asymmetric reduced form auctions. Using this, auction design problems can be stated in terms of the reduced form only. This allows to solve optimal auction problems when classical solution techniques fail.

We consider a model of firm pricing and consumer choice, where consumers are loss averse and uncertain about their future demand. Possibly, consumers in our model prefer a flat rate to a measured tariff, even though this choice does not minimize their expected billing amount—a behavior in line...

We consider a model of firm pricing and consumer choice, where consumers are loss averse and uncertain about their future demand. Possibly, consumers in our model prefer a flat rate to a measured tariff, even though this choice does not minimize their expected billing amount-a behavior in line...