On the computational complexity of non-dictatorial aggregation

DOI10.1613/JAIR.1.12476OpenAlexW2767797884MaRDI QIDQ5154769FDOQ5154769

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

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

zbMATH Keywords

constraint satisfactionmultiagent systems

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites Work

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

Cited In (4)

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

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)