• 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

Social Ranking Manipulability for the CP-Majority, Banzhaf and Lexicographic Excellence Solutions

Thumbnail
Date
2020
Link to item file
https://hal.archives-ouvertes.fr/hal-02930241
Dewey
Recherche opérationnelle
Sujet
Computational Social Choice; Cooperative Games
DOI
http://dx.doi.org/10.24963/ijcai.2020/3
Conference name
Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence
Conference date
2020
Conference country
JAPAN
Book title
Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}
Author
Christian Bessiere
Publisher
IJCAI
ISBN
978-0-9992411-6-5
URI
https://basepub.dauphine.fr/handle/123456789/21078
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Allouche, Tahar
Escoffier, Bruno
Moretti, Stefano
Ozturk, Meltem
Type
Communication / Conférence
Item number of pages
17-23
Abstract (EN)
We investigate the issue of manipulability for social ranking rules, where the goal is to rank individuals given the ranking of coalitions formed by them and each individual prefers to reach the highest positions in the social ranking. This problem lies at the intersection of computational social choice and the algorithmic theory of power indices. Different social ranking rules have been recently proposed and studied from an axiomatic point of view. In this paper, we focus on rules representing three classical approaches in social choice theory: the marginal contribution approach, the lexicographic approach and the (ceteris paribus) majority one. We first consider some particular members of these families analysing their resistance to a malicious behaviour of individuals. Then, we analyze the computational complexity of manipulation, and complete our theoretical results with simulations in order to analyse the manipulation frequencies and to assess the effects of manipulations.

  • 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.