For groups that must make several decisions of similar form, we define a simple and general mechanism that is designed to promote social efficiency. The mechanism links the various decisions by forcing agents to budget their representations of preferences so that the frequency of preferences...

We develop a theory of price discrimination in many-to-many matching markets in which agents' preferences are vertically and horizontally differentiated. The optimal plans induce negative assortative matching at the margin: agents with a low value for interacting with other agents are included...

This paper studies a mechanism design model where the players and the designer are nodes in a communication network. We characterize the communication networks (directed graphs) for which, in any environment (utilities and beliefs), every incentive compatible social choice function is partially...

These notes examine the problem of how to extend envelope theorems to infinite-horizon dynamic mechanism design settings, with an application to the design of bandit auctions.

We study second-degree price discrimination in markets where the product traded by the monopolist is access to other agents. We derive necessary and sufficient conditions for the welfare and the profit-maximizing mechanisms to employ a single network or a menu of non-exclusive networks. We...

This paper studies a mechanism design model where the players and the designer are nodes in a communication network. The authors characterize the communication networks (directed graphs) for which, in any environment (utilities and beliefs), every incentive compatible social choice function is...

We study optimal patent design in a setting with sequential innovation. Firms innovate by undertaking "research" activities to generate new ideas and by undertaking "development" activities to transform these ideas into viable products. Both innovation incentives and the welfare costs of patent...

This paper studies a mechanism design model where the players and the designer are nodes in a communication network. We characterize the communication networks (directed graphs) for which, in any environment (utilities and beliefs), every incentive compatible social choice function is partially...

These notes examine the problem of how to extend envelope theorems to infinite-horizon dynamic mechanism design settings, with an application to the design of "bandit auctions."

These notes examine the problem of how to extend envelope theorems to infinite-horizon dynamic mechanism design settings, with an application to the design of "bandit auctions."