Logical preference representation and combinatorial vote

被引:86
作者
Lang, J [1 ]
机构
[1] Univ Toulouse 3, IRIT, F-31062 Toulouse, France
关键词
preference representation; computational complexity; group decision making;
D O I
10.1023/B:AMAI.0000034522.25580.09
中图分类号
TP18 [人工智能理论];
学科分类号
081104 [模式识别与智能系统]; 0812 [计算机科学与技术]; 0835 [软件工程]; 1405 [智能科学与技术];
摘要
We introduce the notion of combinatorial vote, where a group of agents ( or voters) is supposed to express preferences and come to a common decision concerning a set of nonindependent variables to assign. We study two key issues pertaining to combinatorial vote, namely preference representation and the automated choice of an optimal decision. For each of these issues, we briefly review the state of the art, we try to define the main problems to be solved and identify their computational complexity.
引用
收藏
页码:37 / 71
页数:35
相关论文
共 52 条
[1]
[Anonymous], 2001, P 17 C UNCERTAINTY A
[2]
[Anonymous], 1998, KR 98
[3]
Baccelli F., 1995, Proceedings. Ninth Workshop on Parallel and Distributed Simulation. (PADS'95) (Cat. No.95TB8096), P3, DOI 10.1109/PADS.1995.404322
[4]
Bacchus F, 1996, MOR KAUF R, P542
[5]
BENFERHAT S, 1993, IJCAI-93, VOLS 1 AND 2, P640
[6]
BENFERHAT S, 2002, P 8 INT C PRINC KNOW, P421
[7]
BOUTILIER C, 1994, MOR KAUF R, P75
[8]
Boutilier C, 1999, UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, P71
[9]
BOUTILIER C, 2001, P 17 INT JOINT C ART, P1211
[10]
BRAFMAN RI, 1995, P 14 INT JOINT C ART, P1458