• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - No thumbnail

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

Allouche, Tahar; Escoffier, Bruno; Moretti, Stefano; Ozturk, Meltem (2020), Social Ranking Manipulability for the CP-Majority, Banzhaf and Lexicographic Excellence Solutions, in Christian Bessiere, Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}, IJCAI, p. 17-23. 10.24963/ijcai.2020/3

Type
Communication / Conférence
External document link
https://hal.archives-ouvertes.fr/hal-02930241
Date
2020
Conference title
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}
Book author
Christian Bessiere
Publisher
IJCAI
ISBN
978-0-9992411-6-5
Pages
17-23
Publication identifier
10.24963/ijcai.2020/3
Metadata
Show full item record
Author(s)
Allouche, Tahar
Escoffier, Bruno
Moretti, Stefano cc
Ozturk, Meltem
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.
Subjects / Keywords
Computational Social Choice; Cooperative Games

Related items

Showing items related by title and author.

  • Thumbnail
    Ceteris Paribus Majority for social ranking 
    Haret, Adrian; Khani, Hossein; Moretti, Stefano; Ozturk, Meltem (2018) Communication / Conférence
  • Thumbnail
    Ordinal Social ranking: simulation for CP-majority rule 
    Fayard, Nicolas; Ozturk, Meltem (2018) Communication / Conférence
  • Thumbnail
    Some Axiomatic and Algorithmic Perspectives on the Social Ranking Problem 
    Moretti, Stefano; Ozturk, Meltem (2017) Communication / Conférence
  • Thumbnail
    An Ordinal Banzhaf Index for Social Ranking 
    Khani, Hossein; Moretti, Stefano; Ozturk, Meltem (2019) Communication / Conférence
  • Thumbnail
    Ordinal power relations and social rankings 
    Moretti, Stefano; Ozturk, Meltem (2016) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo