Preferences single-peaked on a tree: Sampling and tree recognition
In voting theory, impossibility results and computational hardness results are often circumvented by recognising that voters' preferences are not arbitrary, but lie within a restricted domain. Uncovering the structure of the underlying domain often provides useful insights about the nature of t...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
Association for the Advancement of Artificial Intelligence
2019
|