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...
主要な著者: | Peters, D, Elkind, E |
---|---|
フォーマット: | Conference item |
言語: | English |
出版事項: |
AAAI Press
2016
|
類似資料
-
Preferences single-peaked on a tree: Sampling and tree recognition
著者:: Sliwinski, J, 等
出版事項: (2019) -
Preferences single-peaked on a tree: Multiwinner elections and structural results
著者:: Peters, D, 等
出版事項: (2022) -
Multiwinner Elections Under Preferences That Are Single−Peaked on a Tree
著者:: Yu, L, 等
出版事項: (2013) -
Preferences single-peaked on a circle
著者:: Peters, D, 等
出版事項: (2017) -
On recognising nearly single-crossing preferences
著者:: Jaeckle, F, 等
出版事項: (2018)