• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Permutation-Based Randomised Tournament Solutions

Thumbnail
Date
2017
Dewey
Intelligence artificielle
Sujet
Tournament; Probabilistic rules; Refinements; Condorcet consistency
DOI
http://dx.doi.org/10.1007/978-3-030-01713-2_17
Conference name
Multi-Agent Systems and Agreement Technologies - 15th European Conference, EUMAS 2017, and 5th International Conference, AT 2017, Evry, France, December 14-15, 2017, Revised Selected Papers
Conference date
2017
Author
Francesco Belardinelli and Estefania Argente
Publisher
Springer International Publishing
Publisher city
Berlin Heidelberg
ISBN
978-3-030-01712-5
Book URL
10.1007/978-3-030-01713-2
URI
https://basepub.dauphine.fr/handle/123456789/19253
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Airiau, Stéphane
Kruger, Justin
Type
Communication / Conférence
Item number of pages
235-250
Abstract (EN)
Voting rules that are based on the majority graph typically output large sets of winners. In this full original paper our goal is to investigate a general method which leads to randomized version of such rules. We use the idea of parallel universes, where each universe is connected with a permutation over alternatives. The permutation allows us to construct resolute voting rules (i.e. rules that always choose unique winners). Such resolute rules can be constructed in a variety of ways: we consider using binary voting trees to select a single alternative. In turn this permits the construction of neutral rules that output the set the possible winners of every parallel universe. The question of which rules can be constructed in this way has already been partially studied under the heading of agenda implementability. We further propose a randomised version in which the probability of being the winner is the ratio of universes in which the alternative wins. We also briefly consider (typically novel) rules that elect the alternatives that have maximal winning probability. These rules typically output small sets of winners, thus provide refinements of known tournament solutions.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.