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

Consider a setting in which individual strict preferences need to be aggregated into a social strict preference relation. For two alternatives and an odd number of agents, it follows from May’s Theorem that the majority aggregation rule is the only one satisfying anonymity, neutrality, and...

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

Condorcet domains are sets of linear orders with the property that, whenever the preferences of all voters of a society belong to this set, their majority relation has no cycles. We observe that, without loss of generality, every such domain can be assumed to be closed in the sense that it...

In this short paper we provide two versions of Arrow’s impossibility theorem, in a world with only one preference profile. Both versions are extremely simple and allow a transparent understanding of Arrow’s theorem. The first version assumes a two-agent society; the second version, which is...

In this paper we provide a simple new version of Arrow’s impossibility theorem, in a world with only one preference profile. This theorem relies on a new assumption of preference diversity, and we explore alternative notions of preference diversity at length.

This paper continues Dietrich and List's [2010] work on propositional-attitude aggregation theory, which is a generalised unification of the judgment-aggregation and probabilistic opinion-pooling literatures. We first propose an algebraic framework for an analysis of (many-valued)...

We characterize the preference domains on which the Borda count satisfies Arrow's ``independence of irrelevant alternatives" condition. Under a weak richness condition, these domains are obtained by fixing one preference ordering and including all its cyclic permutations (``Condorcet cycles")....

It is well known that the literature on judgment aggregation inherits the impossibility results from the aggregation of preferences that it generalises. This is due to the fact that the typical judgment aggregation problem induces an ultrafilter on the the set of individuals, as was shown in a...

This paper studies collective decision making with regard to convex risk measures: It addresses the question whether there exist nondictatorial aggregation functions of convex risk measures satisfying Arrow-type rationality axioms (weak universality, systematicity, Pareto principle). Herein,...