This paper considers games in which multiple principals contract simultaneously with the same agent. We introduce a new class of revelation mechanisms that, although it does not always permit a complete equilibrium characterization, it facilitates the characterization of the equilibrium outcomes...

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

This paper considers games in which multiple principals contract simultaneously with the same agent. We introduce a new class of revelation mechanisms that, although it does not always permit a complete equilibrium characterization, it facilitates the characterization of the equilibrium outcomes...

In open, anonymous settings such as the Internet, agents can participate in a mechanism multiple times under different identities. A mechanism is false-name-proof if no agent ever benefits from participating more than once. Unfortunately, the design of false-name-proof mechanisms has been...

The present paper studies the problem on multi-dimensional mechanisms in which the buyer’s taste and budget are his private information. The paper investigates the problem by way of a canonical mechanism in the traditional one-dimensional setting: function of one variable, the buyer’s taste....

This chapter deals with uncertainty and incomplete information in markets. It first considers situations in which the contract proposer is the ignorant party with the problem of designing a mechanism that induces the counter party, who is exogenously endowed with his information, to reveal that...