On the hardness of bribery variants in voting with CP-nets.
Britta DornDominikus KrügerPublished in: Ann. Math. Artif. Intell. (2016)
Keyphrases
- cp nets
- social choice
- preference aggregation
- voting rules
- preference elicitation
- multi attribute
- multiple agents
- proof theory
- graphical representation
- soft constraints
- np hard
- computational complexity
- preference relations
- preference ordering
- phase transition
- np complete
- objective function
- single agent
- learning theory
- partial order
- worst case
- high dimensional