Single-peakedness Based on the Net Preference Matrix: Characterization and Algorithms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Single-peakedness Based on the Net Preference Matrix: Characterization and Algorithms

Résumé

In this paper, we propose a new relaxation of the single-peaked property by constraining the net preference matrix instead of the preference profile. More precisely, this new domain restriction holds for a given profile P if there exists a single-peaked profile P' with the same net preference matrix as P. We provide a characterization of net preference matrices that can be “implemented” by a single-peaked profile, and propose a polynomial time algorithm to recognize these matrices. In cases where preferences are not net single-peaked, we recall a dynamic programming approach for obtaining an axis over candidates such that the net preference matrix respects as much as possible (in some sense) our net single-peakedness condition. We also formulate an integer linear program for partial net single-peakedness. Finally we present the results of numerical tests on real election data.
Fichier principal
Vignette du fichier
SpanjaardWengCOMSOC2016.pdf (377.13 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01518068 , version 1 (30-06-2017)

Identifiants

  • HAL Id : hal-01518068 , version 1

Citer

Olivier Spanjaard, Paul Weng. Single-peakedness Based on the Net Preference Matrix: Characterization and Algorithms. 6th International Workshop on Computational Social Choice (COMSOC-2016), Jun 2016, Toulouse, France. ⟨hal-01518068⟩
77 Consultations
103 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More