On the likelihood of single-peaked preferences
This paper contains an extensive combinatorial analysis of the single-peaked domain restriction and investigates the likelihood that an election is single-peaked. We provide a very general upper bound result for domain restrictions that can be defined by certain forbidden configurations. This upper...
Main Author: | Lackner, M |
---|---|
Format: | Journal article |
Published: |
Springer Berlin Heidelberg
2017
|
Similar Items
-
Preferences single-peaked on a circle
by: Peters, D, et al.
Published: (2017) -
Computational aspects of nearly single-peaked electorates
by: Erdelyi, G, et al.
Published: (2017) -
On Detecting Nearly Structured Preference Profiles
by: Elkind, E, et al.
Published: (2014) -
Preferences single-peaked on nice trees
by: Peters, D, et al.
Published: (2016) -
Preference restrictions in computational social choice: recent progress
by: Elkind, E, et al.
Published: (2016)