We study efficient and stable mechanisms in matching markets when the number of agents is large and individuals' preferences and priorities are drawn randomly. When agents' preferences are uncorrelated, then both efficiency and stability can be achieved in an asymptotic sense via standard...

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...

We show that any transferable utility game can be represented by an assignment of facilities to players, in which it is intuitively obvious how to allocate the total cost of the facilities. The intuitive solution in the representation turns out to be the Shapley value of the game, and thus...

We consider an auction environment with interdependent values. Each bidder can learn her payoff type through costly information acquisition. We contrast the socially optimal decision to acquire information with the equilibrium solution in which each agent has to privately bear the cost of...

This introduces the symposium on judgment aggregation. The theory of judgment ag­gregation asks how several individuals' judgments on some logically connected propositions can be aggregated into consistent collective judgments. The aim of this intro­duction is to show how ideas from the...

This forthcoming chapter in the Handbook of Income Distribution (eds., A. Atkinson and F. Bourguignon) summarizes the literature on equality of opportunity. We begin by reviewing the philosophical debate concerning equality since Rawls (sections 1 and 2), present economic algorithms for...

We provide an axiomatization of generalized utilitarian social welfare functions in the context of Harsanyi's impartial observer theorem. To do this, we reformulate Harsanyi's problem such that lotteries over identity (accidents of birth) and lotteries over outcomes (life chances) are...

The random priority (random serial dictatorship) mechanism is a common method for assigning objects to individuals. The mechanism is easy to implement and strategy-proof. However this mechanism is inefficient, as the agents may be made all better off by another mechanism that increases their...