We study a combinatorial variant of the classical principal-agent model. In our setting a principal wishes to incentivize a team of strategic agents to exert costly effort on his behalf. Agentsʼ actions are hidden and the principal observes only the outcome of the team, which depends...

A class of voting procedures based on repeated ballots and elimination of one candidate in each round is shown to always induce an outcome in the top cycle and is thus Condorcet consistent, when voters behave strategically. This is an important class as it covers multi-stage, sequential...

We characterize the incentive compatible, constrained efficient policy (“second-best”) in a dynamic matching environment, where impatient, privately informed agents arrive over time, and where the designer gradually learns about the distribution of agentsʼ values. We also derive conditions...

We study a notion of locally robust implementation that captures the idea that the planner may know agentsʼ beliefs well, but not perfectly. Locally robust implementation is a weaker concept than ex-post implementation, but we show that no regular allocation function is locally robust...

Two sellers decide on their discrete supply of a homogenous good. There is a finite number of buyers with unit demand and privately known valuations. In the first model, there is a centralized market place where a uniform auction takes place. In the second, there are two distinct auction sites,...