Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability
Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem
Advances in Applied Mathematics
Linearity testing in characteristic two
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Some topics in analysis of boolean functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Elections Can be Manipulated Often
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Socially desirable approximations for Dodgson's voting rule
Proceedings of the 11th ACM conference on Electronic commerce
On the role of distances in defining voting rules
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Judgment aggregation rules based on minimization
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Approximate judgement aggregation
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
| Hi-index | 0.00 |
This paper analyzes judgement aggregation problems in which a group of agents independently votes on a set of complex propositions subject to an interdependency constraint. It considers the issue of judgement aggregation from the perspective of approximation; that is, it generalizes the classic framework of judgement aggregation by relaxing the two main constraints assumed in the literature, Consistency and Independence. In doing so, it also considers mechanisms that only approximately satisfy these constraints, that is, satisfy them up to a small fraction of the inputs. The main question raised is whether the relaxation of these constraints significantly alters the class of aggregation mechanisms that meet the two (relaxed) constraints. The main result of this paper is that in the case of a subclass of a natural class of aggregation problems termed "truth-functional agendas," the set of aggregation mechanisms that meet the constraints does not extend nontrivially when the constraints are relaxed. This paper also shows connections between this new general framework and the works on approximation of preference aggregation as well as the field of Property Testing and particularly linear testing of Boolean functions.