Judgment Aggregation Rules and Voting Rules

  • Jérôme Lang
  • Marija Slavkovik
Conference paper

DOI: 10.1007/978-3-642-41575-3_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8176)
Cite this paper as:
Lang J., Slavkovik M. (2013) Judgment Aggregation Rules and Voting Rules. In: Perny P., Pirlot M., Tsoukiàs A. (eds) Algorithmic Decision Theory. ADT 2013. Lecture Notes in Computer Science, vol 8176. Springer, Berlin, Heidelberg

Abstract

Several recent articles have defined and studied judgment aggregation rules based on some minimization principle. Although some of them are defined by analogy with some voting rules, the exact connection between these rules and voting rules is not always obvious. We explore these connections and show how several well-known voting rules such as the top cycle, Copeland, maximin, Slater or ranked pairs, are recovered as specific cases of judgment aggregation rules.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Jérôme Lang
    • 1
  • Marija Slavkovik
    • 2
    • 3
  1. 1.Université Paris-DauphineFrance
  2. 2.University of LiverpoolUK
  3. 3.University of BergenNorway

Personalised recommendations