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...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Language: | English |
| Published: |
AAAI Press
2016
|