We study an elimination tournament with heterogenous contestants whose ability is common-knowledge. Each pair-wise match is modeled as an all-pay auction where the winner gets the right to compete at the next round. Equilibrium efforts are in mixed strategies, yielding rather complex play...

Lecture on the first SFB/TR 15 meeting, Gummersbach, July, 18 - 20, 2004: We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing time. They make bids upon arrival at a...

We study two-sided markets with a finite numbers of agents on each side, and with two-sided incomplete information. Agents are matched assortatively on the basis of costly signals. A main goal is to identify conditions under which the potential increase in expected output due to assortative...

We study the effects of allocative and informational externalities in (multi-object) auctions and related mechanisms. Such externalities naturally arise in models that embed auctions in larger economic contexts. In particular, they appear when there is downstream interaction among bidders after...

We study dominant strategy incentive compatible (DIC) and deterministic mechanisms in a social choice setting with several alternatives. The agents are privately informed about their preferences, and have single-crossing utility functions. Monetary transfers are not feasible. We use an...

We study the optimal design of organizations under the assumption that agents in a contest care about their relative position. A judicious definition of status categories can be used by a principal in order to influence the agents' performance. We first consider a pure status case where there...

We study multi-object auctions where agents have private and additive valuations for heterogeneous objects. We focus on the revenue properties of a class of dominant strategy mechanisms where a weight is assigned to each partition of objects. The weights influence the probability with which...

We analyze maximization of revenue in the dynamic and stochastic knapsack problem where a given capacity needs to be allocated by a given deadline to sequentially arriving agents. Each agent is described by a two-dimensional type that reflects his capacity requirement and his willingness to pay...

A committee decides by unanimity whether to accept the current alternative, or to continue costly search. Each alternative is described by a vector of distinct attributes, and each committee member can privately assess the quality of one attribute (her "specialty"). Preferences are heterogeneous...

We study a multi-dimensional collective decision under incomplete information. Agents have Euclidean preferences and vote by simple majority on each issue (dimension), yielding the coordinate-wise median. Judicious rotations of the orthogonal axes -- the issues that are voted upon -- lead to...