• 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

Recovering non-monotonicity problems of voting rules

Keskin, Umut; Sanver, Remzi; Tosunlu, H. Berkay (2019), Recovering non-monotonicity problems of voting rules, Social Choice and Welfare, 56, 1, p. 125–141. 10.1007/s00355-020-01272-0

View/Open
Keskin2021_Recovering.pdf (3.527Mb)
Type
Article accepté pour publication ou publié
Date
2019
Journal name
Social Choice and Welfare
Volume
56
Number
1
Publisher
Springer
Pages
125–141
Publication identifier
10.1007/s00355-020-01272-0
Metadata
Show full item record
Author(s)
Keskin, Umut
Sanver, Remzi
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Tosunlu, H. Berkay
Abstract (EN)
A social choice rule (SCR) is monotonic if raising a single alternative in voters’ preferences while leaving the rankings otherwise unchanged is never detrimental to the prospects for winning of the raised alternative. Monotonicity is rather weak but well-known to discriminate against scoring elimination rules, such as plurality with a run off and single transferable vote. We define the minimal monotonic extension of an SCR as its unique monotonic supercorrespondence that is minimal with respect to set inclusion. After showing the existence of the concept, we characterize, for every non-monotonic SCR, the alternatives that its minimal monotonic extension must contain. As minimal monotonic extensions can entail coarse SCRs, we address the possibility of refining them without violating monotonicity provided that this refinement does not diverge from the original SCR more than the divergence prescribed by the minimal monotonic extension itself. We call these refinements monotonic adjustments and identify conditions over SCRs that ensure unique monotonic adjustments that are minimal with respect to set inclusion. As an application of our general findings, we consider plurality with a runoff, characterize its minimal monotonic extension as well as its (unique) minimal monotonic adjustment. Interestingly, this adjustment is not coarser than plurality with a runoff itself, hence we suggest it as a monotonic substitute to plurality with a runoff.
Subjects / Keywords
monotonicity; minimal monotonic extension; minimal monotonic adjustment; plurality with a runoff; voting rule

Related items

Showing items related by title and author.

  • Thumbnail
    Monotonicity violations under plurality with a runoff: the case of French presidential elections 
    Keskin, Umut; Sanver, M. Remzi; Tosunlu, Halil Berkay (2022) Article accepté pour publication ou publié
  • Thumbnail
    Monotonicity Violations under Plurality with a RunOff : The Case of French Presidential Elections 
    Keskin, Umut; Sanver, Remzi; Tosunlu, Halil Berkay (2021) Document de travail / Working paper
  • Thumbnail
    On the subgame perfect implementability of voting rules 
    Nunez, Matias; Sanver, Remzi (2018) Article accepté pour publication ou publié
  • Thumbnail
    Positively responsive collective choice rules and majority rule: A generalization of May’s theorem to many alternatives, 
    Horan, Sean; Osborne, Martin; Sanver, Remzi (2019) Article accepté pour publication ou publié
  • Thumbnail
    Compromise rules revisited 
    Merlin, Vincent; Özkal Sanver, İpek; Sanver, Remzi (2019) Article accepté pour publication ou publié
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