PP-2013-11: Binary Aggregation by Selection of the Most Representative Voter

PP-2013-11: Endriss, Ulle and Grandi, Umberto (2013) Binary Aggregation by Selection of the Most Representative Voter. [Report]

[img]
Preview
Text (Full Text)
PP-2013-11.text.pdf

Download (275kB) | Preview
[img] Text (Abstract)
PP-2013-11.abstract.txt

Download (1kB)

Abstract

In a binary aggregation problem, a group of voters each express yes/no choices regarding a number of possibly correlated issues and we are asked to decide on a collective choice that accurately reflects the views of this group. A good collective choice will minimise the distance to each of the individual choices, but using such a distance-based aggregation rule is computationally intractable. Instead, we explore a class of aggregation rules that select the most representative voter in any given situation and return that voter’s choice as the collective out- come. Two such rules, the average-voter rule and the majority-voter rule, are particularly attractive. We analyse their social choice-theoretic properties, their algorithmic efficiency, and the extent to which they are able to approximate the ideal defined by the distance-based rule. We also discuss the relevance of our results for the related framework of preference aggregation.

Item Type: Report
Report Nr: PP-2013-11
Series Name: Prepublication (PP) Series
Year: 2013
Uncontrolled Keywords: computational social choice
Subjects: Computation
Depositing User: Ulle Endriss
Date Deposited: 12 Oct 2016 14:37
Last Modified: 12 Oct 2016 14:37
URI: https://eprints.illc.uva.nl/id/eprint/483

Actions (login required)

View Item View Item