PP-2015-24: A Syntactic Proof of Arrow's Theorem in a Modal Logic of Social Choice Functions

PP-2015-24: Ciná, Giovanni and Endriss, Ulle (2015) A Syntactic Proof of Arrow's Theorem in a Modal Logic of Social Choice Functions. [Report]

[thumbnail of Full Text]
Preview
Text (Full Text)
PP-2015-24.text.pdf

Download (303kB) | Preview
[thumbnail of Abstract] Text (Abstract)
PP-2015-24.abstract.txt

Download (695B)

Abstract

We show how to formalise Arrow's Theorem on the impossibility of devising a method for preference aggregation that is both independent of irrelevant alternatives and Pareto efficient by using a modal logic of social choice functions. We also provide a syntactic proof of the theorem in that logic. While prior work has been successful in applying tools from logic and automated reasoning to social choice theory, this is the first human-readable formalisation of the Arrovian framework allowing for a direct derivation of the theorem.

Item Type: Report
Report Nr: PP-2015-24
Series Name: Prepublication (PP) Series
Year: 2015
Uncontrolled Keywords: social choice theory, logic
Subjects: Logic
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/535

Actions (login required)

View Item View Item