Journal of Logic and Computation Advance Access published online on May 19, 2008
Journal of Logic and Computation, doi:10.1093/logcom/exn009
Original Papers |
A General Approach to Aggregation Problems
Amsterdam School of Economics, and Tinbergen Institute, Universiteit van Amsterdam. E-mail: tijmen.daniels{at}uva.nl
Department of Computer Science, Stanford University. E-mail: epacuit{at}stanford.edu
Received 1 July 2008.
| Abstract |
|---|
We discuss a general approach to judgement aggregation based on lattice theory. Agents choose elements of a lattice, and an aggregation procedure yields a `social choice' based on the individual choices. Settings traditionally studied in social choice theory can be thought of as implicational systems, and lattice theory provides an abstraction of such systems. In fact, traditionally studied settings correspond to certain atomistic lattices in our framework. Our aim is to systematically investigate how properties of a given lattice induce constraints on aggregation procedures that lead up to impossibility theorems. We allow for non-atomistic lattices and this raises some subtle issues. We will discuss how well our framework fits in with the traditional approaches to social choice theory, in particular with respect to generalizations of some of the well known axioms, and go on prove an impossibility result that highlights the role of certain lattice theoretical properties. These properties reflect some of the traditional axioms or other aspects of traditional systems.
Keywords: Social choice theory; judgement aggregation; lattice theory; (im)possibility theorems