An Efficient Procedure for Collective Decision-making with CP-nets

Authors:
Minyi Li;Quoc Bao Vo;Ryszard Kowalczyk
Affiliations:
Swinburne University of Technology, Australia, email: {myli,BVo,RKowalczyk}@swin.edu.au;Swinburne University of Technology, Australia, email: {myli,BVo,RKowalczyk}@swin.edu.au;Swinburne University of Technology, Australia, email: {myli,BVo,RKowalczyk}@swin.edu.au
Venue:
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Year:
2010

Citing 10
Cited 2

Compact value-function representations for qualitative preferences

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Making social choices from individuals' CP-nets

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
mCP nets: representing and reasoning with preferences of multiple agents

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Strongly decomposable voting rules on multiattribute domains

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Voting on multiattribute domains with cyclic preferential dependencies

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
The computational complexity of dominance and consistency in CP-Nets

Journal of Artificial Intelligence Research
Incompleteness and incomparability in preference aggregation

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Introducing variable importance tradeoffs into CP-nets

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Graphical models for preference and utility

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence

Aggregating dependency graphs into voting agendas in multi-issue elections

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Hypercubewise preference aggregation in multi-issue domains

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the problem of collective decision-making in the case where the agents' preferences are represented by CP-nets (conditional preference networks). In many real-world decision-making problems, the number of possible outcomes is exponential in the number of domain variables. Most related works either do not consider computational concerns, or depend on a strong assumption that all the agents' CP-nets share a common preferential-independence structure. To this end, we introduce a novel procedure for collective decision-making with CP-nets. Our proposed approach allows the agents to have different preferential-independence structures and guarantees Pareto-optimality. Our experimental results demonstrate that our proposed procedure is computationally efficient and produces the results that are close to the fair Minimax solution.