A syntactic proof of Arrow's Theorem in a modal logic of social choice functions

Giovanni Cinà, Ulle Endriss

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

7 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationAAMAS 2015 - Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems
EditorsEdith Elkind, Gerhard Weiss, Pinar Yolum, Rafael H. Bordini
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages1009-1017
Number of pages9
ISBN (Electronic)9781450337700
Publication statusPublished - 2015
Event14th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015 - Istanbul, Turkey
Duration: 4 May 20158 May 2015

Publication series

NameProceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Volume2

Conference

Conference14th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015
Country/TerritoryTurkey
CityIstanbul
Period4/05/20158/05/2015

Keywords

  • Logic
  • Social choice theory

Cite this