A distributed social choice protocol for combinatorial domains

DOI10.1007/s10732-014-9246-1zbMath1360.91088OpenAlexW1970431798MaRDI QIDQ524881

Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk

Publication date: 26 April 2017

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-014-9246-1

zbMATH Keywords

negotiationCP-netsbest possible agreementcombinatorial domainsstructural preferences

Mathematics Subject Classification ID

Decision theory (91B06) Group preferences (91B10) Social choice (91B14)

Uses Software

• CP-nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method
• Logical preference representation and combinatorial vote
• \(\text{DA}^2\) merging operators
• Sequential composition of voting rules in multi-issue domains
• Propositional belief base merging or how to merge beliefs/goals coming from several sources and some links with social choice theory
• Handbook of social choice and welfare. Vol. 1.
• The paradox of multiple elections
• Hard and soft constraints for reasoning about qualitative conditional preferences
• Determining Possible and Necessary Winners Given Partial Orders
• The Computational Complexity of Choice Sets
• Interjurisdictional Sorting and Majority Rule: An Empirical Analysis
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A distributed social choice protocol for combinatorial domains