The Complexity Landscape of Outcome Determination in Judgment Aggregation
From MaRDI portal
Publication:5139591
DOI10.1613/jair.1.11970zbMath1496.68315OpenAlexW3096008849MaRDI QIDQ5139591
Marija Slavkovik, Jérôme Lang, Ulle Endriss, Ronald de Haan
Publication date: 9 December 2020
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.1.11970
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42)
Related Items
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas ⋮ Strategic manipulation in judgment aggregation under higher-level reasoning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The theory of judgment aggregation: an introductory review
- Judgment aggregation and the problem of tracking the truth
- The Condorcet set: majority voting over interconnected propositions
- Scoring rules for judgment aggregation
- Independence of clones as a criterion for voting rules
- The strong exponential hierarchy collapses
- Methods for distance-based judgment aggregation
- \(\text{DA}^2\) merging operators
- The complexity of Kemeny elections
- Logical constraints on judgement aggregation
- Belief merging and the discursive dilemma: an argument-based account to paradoxes of judgment aggregation
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
- Judgment aggregation without full rationality
- Aggregation of binary evaluations
- The premiss-based approach to judgment aggregation
- The structure of strategy-proof social choice. I: General characterization and possibility results on median spaces
- The complexity of optimization problems
- On truth-table reducibility to SAT
- Generalizations of Opt P to the polynomial hierarchy
- The polynomial-time hierarchy
- Complete sets and the polynomial-time hierarchy
- Extending Condorcet's rule
- Preferred answer sets for extended logic programs
- Exact complexity of the winner problem for Young elections
- The complexity of selecting maximal solutions
- On the hardness of maximum rank aggregation problems
- Complexity of control in judgment aggregation for uniform premise-based quota rules
- Majority rule in the absence of a majority
- A partial taxonomy of judgment aggregation rules and their properties
- Lifting integrity constraints in binary aggregation
- A measure of distance between judgment sets
- Arrow's theorem in judgment aggregation
- Measuring Dissimilarity between Judgment Sets
- Ontology merging as social choice: judgment aggregation under the open world assumption
- Search versus Decision for Election Manipulation Problems
- Complexity of Judgment Aggregation
- Introduction to Judgment Aggregation
- Bounded Query Classes
- Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
- The difference and truth-table hierarchies for NP
- Exact analysis of Dodgson elections
- Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
- Merging Information Under Constraints: A Logical Framework
- Tournament Solutions
- Weighted Tournament Solutions
- Judgment Aggregation
- Handbook of Computational Social Choice
- Computational Complexity
- Logic and structure
- Algorithm for optimal winner determination in combinatorial auctions
This page was built for publication: The Complexity Landscape of Outcome Determination in Judgment Aggregation
