We introduce a new notion of ex-post efficiency for random assignment problems, namely ex-post rank efficiency that gives a maximal number of agents their favored objects. An ex-post rank efficient random assignment is a lottery over rank efficient deterministic assignments, in the sense of...

We study the problem of assigning indivisible objects to agents where each is to receive one object. To ensure fairness in the absence of monetary compensation, we consider random assignments. Random Priority, also known as Random Serial Dictatorship, is characterized by symmetry, ex-post...

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision

This paper considers the problem of allocating N indivisible objects among N agents according to their preferences when transfers are not allowed, and studies the tradeoff between fairness and efficiency in the class of strategy-proof mechanisms. The main finding is that for strategy-proof...

Inefficient Markov-perfect equilibria (MPE) are prevalent in dynamic matching and bargaining games (DMBG). I observe this inefficiency is caused by a substantial friction commonly assumed in the literature: players must exit the market after trading once. In response, this paper studies a simple...

Consider agents who undertake costly effort to produce stochastic outputs observable by a principal. The principal can award a prize deterministically to the agent with the highest output, or to all of them with probabilities that are proportional to their outputs. We show that, if there is...