On the computational complexity of non-dictatorial aggregation

DOI10.1613/JAIR.1.12476MaRDI QIDQ5154769zbMATH OpenOpenAlexFDO

Authors John Livieratos, Phokion G. Kolaitis, L. M. Kirousis

Publication date 5 October 2021

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.1.12476

zbMATH Keywords

constraint satisfactionmultiagent systems

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• On the computational complexity of non-dictatorial aggregation
• Aggregation of votes with multiple positions on each issue
• Aggregation of non-binary evaluations
• Algorithmically efficient syntactic characterization of possibility domains
• Complexity of judgment aggregation

Cites work

• A dichotomy theorem for constraint satisfaction problems on a 3-element set
• A mathematical introduction to logic.
• A strong-connectivity algorithm and its applications in data flow analysis
• Abstract Arrowian aggregation
• Aggregation of binary evaluations
• Aggregation of binary evaluations for truth-functional agendas
• Aggregation of equivalence relations
• Aggregation of non-binary evaluations
• Aggregation of votes with multiple positions on each issue
• Algebra and the complexity of digraph CSPs: a survey
• Algebraic aggregation theory
• Algorithmically efficient syntactic characterization of possibility domains
• Complexity of conservative constraint satisfaction problems
• Complexity of judgment aggregation
• Conditional independence in propositional logic.
• Depth-First Search and Linear Graph Algorithms
• Elements of finite model theory.
• Factoring out the impossibility of logical aggregation
• How to determine the expressive power of constraints
• scientific article; zbMATH DE number 3972929 (Why is no real title available?)
• scientific article; zbMATH DE number 1254648 (Why is no real title available?)
• scientific article; zbMATH DE number 1946872 (Why is no real title available?)
• Judgment aggregation
• Lifting integrity constraints in binary aggregation
• On the computational complexity of non-dictatorial aggregation
• On the question ``who is a \(J\)?: a social choice approach
• Social choice and individual values
• The complexity of satisfiability problems
• The polynomial-time hierarchy
• The structure of strategy-proof social choice. I: General characterization and possibility results on median spaces
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

Cited in

(5)

• On the computational complexity of non-dictatorial aggregation
• Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
• Algorithmically efficient syntactic characterization of possibility domains
• Algorithmically efficient syntactic characterization of possibility domains
• Aggregation of votes with multiple positions on each issue

This page was built for publication: On the computational complexity of non-dictatorial aggregation

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