We consider the problem of fairly reallocating the individual endowments of a perfectly divisible good among agents with single-peaked preferences. We provide a new concept of fairness, called position-wise envy-freeness, that is compatible with individual rationality. This new concept requires...

We study the problem of choosing prize winners from among a group of experts when each expert nominates another expert for the prize. A nomination rule determines the set of winners on the basis of the profile of nominations; the rule is impartial if one's nomination never influences one's own...

We consider the problem of probabilistically allocating a single indivisible good among agents when monetary transfers are allowed. We construct a new strategy-proof rule, called the second price trading rule, and show that it is second best efficient. Furthermore, we give the second price...

In this paper we consider the exogenous indifference classes model of Barberá and Ehlers (2011) and Sato (2009) and analyze further the relationship between the structure of indifference classes across agents and dictatorship results. The key to our approach is the pairwise partition graph. We...

We search for impartiality in the allocation of objects when monetary transfers are not possible. Our main focus is anonymity. The standard definition requires that if agents' names are permuted, their assignments should be permuted in the same way. Since no rule satisfies this definition in...

Consider the problem of allocating objects to agents and how much they should pay. Each agent has a preference relation over pairs of a set of objects and a payment. Preferences are not necessarily quasi-linear. Non-quasi-linear preferences describe environments where payments influence agents'...

This paper generalizes the results in Aswal et al. (2003) on dictatorial domains. This is done in two ways. In the first, the notion of connections between pairs of alternatives in Aswal et al. (2003) is weakened to weak connectedness. This notion requires the specification of four preference...

This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to matching problems. Alcalde and Barberá (1994) show that effcient and individually rational matching rules are manipulable in the one-to-one matching model. We pursue the possibility of strategy-proof...

This paper studies the application of the notion of secure implementation (Cason, Saijo, Sjöström, and Yamato, 2006; Saijo, Sjöström, and Yamato, 2007) to the problem of allocating indivisible objects with monetary transfers. We propose a new domain-richness condition, termed as minimal...

Following Barberà, Sonnenschein, and Zhou (1991, Econometrica 59, 595-609), we study rules (or social choice functions) through which agents select a subset from a set of objects. We investigate domains on which there exist nontrivial strategy-proof rules. We establish that the set of separable...