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

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 possibility of strategy-proof rules yielding satisfactory solutions to matching problems. Alcalde and Barberá (1994) show that efficient and individually rational matching rules are manipulable in the one-to-one matching model. We pursue the possibility of strategy-proof...

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

We model a situation where a set of agents must rank themselves based on their opinions. Each agent submits a message and a function determines the social ranking. We are interested in impartial social ranking functions, that is, those where the message of an agent can not change any social...

We model a situation where a set of agents must rank themselves based on their opinions. Each agent submits a message and a function determines the social ranking. We are interested in impartial social ranking functions, that is, those where the message of an agent can not change any social...