Preferences single-peaked on nice trees
Preference profiles that are single-peaked on trees enjoy desirable properties: they admit a Condorcet winner (Demange 1982), and there are hard voting problems that become tractable on this domain (Yu et al., 2013). Trick (1989) proposed a polynomial-time algorithm that finds some tree with respect...
Egile Nagusiak: | Peters, D, Elkind, E |
---|---|
Formatua: | Conference item |
Hizkuntza: | English |
Argitaratua: |
AAAI Press
2016
|
Antzeko izenburuak
Facility location with double-peaked preferences
nork: Filos-Ratsikas, A, et al.
Argitaratua: (2015)
nork: Filos-Ratsikas, A, et al.
Argitaratua: (2015)
Antzeko izenburuak
-
Preferences single-peaked on a tree: Sampling and tree recognition
nork: Sliwinski, J, et al.
Argitaratua: (2019) -
Preferences single-peaked on a tree: Multiwinner elections and structural results
nork: Peters, D, et al.
Argitaratua: (2022) -
Multiwinner Elections Under Preferences That Are Single−Peaked on a Tree
nork: Yu, L, et al.
Argitaratua: (2013) -
Preferences single-peaked on a circle
nork: Peters, D, et al.
Argitaratua: (2017) -
On recognising nearly single-crossing preferences
nork: Jaeckle, F, et al.
Argitaratua: (2018)