An efficient procedure for collective decision-making with CP-nets

DOI10.3233/978-1-60750-606-5-375MaRDI QIDQ2999163zbMATH OpenOpenAlexFDO

Authors Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk

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)

Recommendations

• Agreeing on social outcomes using individual CP-nets
• scientific article; zbMATH DE number 2243357
• Reasoning with PCP-nets
• A distributed social choice protocol for combinatorial domains
• Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting

Cited in

(7)

• Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
• Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
• Collective decision making
• On the hardness of bribery variants in voting with CP-nets
• A distributed social choice protocol for combinatorial domains
• Aggregating preferences represented by conditional preference networks
• Agreeing on social outcomes using individual CP-nets

Describes a project that uses

Uses Software

• CP-nets

This page was built for publication: An efficient procedure for collective decision-making with CP-nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999163)