On the Computational Complexity of Non-Dictatorial Aggregation
From MaRDI portal
Publication:5154769
DOI10.1613/jair.1.12476OpenAlexW2767797884MaRDI QIDQ5154769
Lefteris M. Kirousis, John Livieratos, Phokion G. Kolaitis
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Elements of finite model theory.
- Factoring out the impossibility of logical aggregation
- Abstract Arrowian aggregation
- Aggregation of binary evaluations
- The structure of strategy-proof social choice. I: General characterization and possibility results on median spaces
- Aggregation of equivalence relations
- Algebraic aggregation theory
- A strong-connectivity algorithm and its applications in data flow analysis
- The polynomial-time hierarchy
- How to determine the expressive power of constraints
- On the computational complexity of non-dictatorial aggregation
- Conditional independence in propositional logic.
- Aggregation of non-binary evaluations
- Aggregation of binary evaluations for truth-functional agendas
- Lifting integrity constraints in binary aggregation
- Complexity of conservative constraint satisfaction problems
- Complexity of Judgment Aggregation
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- Algebra and the Complexity of Digraph CSPs: a Survey
- Judgment Aggregation
- Aggregation of Votes with Multiple Positions on Each Issue
- The complexity of satisfiability problems
- Depth-First Search and Linear Graph Algorithms
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
