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

DOI10.3233/978-1-60750-606-5-375zbMath1211.68269OpenAlexW1763624572MaRDI QIDQ2999163

Ryszard Kowalczyk, Minyi Li, Quoc Bao Vo

Publication date: 11 May 2011

Full work available at URL: https://dblp.uni-trier.de/db/conf/ecai/ecai2010.html#LiVK10

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Management decision making, including multiple objectives (90B50) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

On the hardness of bribery variants in voting with CP-nets ⋮ Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting ⋮ Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting

Uses Software

• CP-nets

This page was built for publication: An Efficient Procedure for Collective Decision-making with CP-nets