This paper illustrates the benefits of applying mechanism design techniques to questions in revenue management, in particular to dynamic allocation and pricing problems. It is demonstrated that the solution to a sequential stochastic assignment problem under complete information can also be...

We study the revenue-maximizing allocation of several heterogeneous, commonly ranked objects to impatient agents with privately known characteristics who arrive sequentially. There is a deadline after which no more objects can be allocated. We first characterize implementable allocation schemes,...

Combining the result of Palfrey (1983) about the role of bundling and the revenue equivalence theorem, this note shows that there is a conflict between revenue maximization and efficiency in multi-object auctions even with symmetric bidders.

In a sequential bargaining model of coalition formation and payoff M division players form demands for their participation in a coalition. These M demands have some appealing, intuitive features. We characterize the sets of M semi-stable and stable demands vectors for general NTU games using M...

In this paper we analyze a simple non-cooperative bargaining model for coalition formation and payoff distribution for games in coalitional form. We show that under our bargaining regime a cooperative game is core-implementable and if it possesses the property of increasing returns to scale for...