The complexity landscape of outcome determination in judgment aggregation
From MaRDI portal
(Redirected from Publication:5139591)
Recommendations
Cites work
- scientific article; zbMATH DE number 3799016 (Why is no real title available?)
- A measure of distance between judgment sets
- A partial taxonomy of judgment aggregation rules and their properties
- Aggregation of binary evaluations
- Algorithm for optimal winner determination in combinatorial auctions
- Arrow's theorem in judgment aggregation
- Belief merging and the discursive dilemma: an argument-based account to paradoxes of judgment aggregation
- Bounded Query Classes
- Complete sets and the polynomial-time hierarchy
- Complexity of control in judgment aggregation for uniform premise-based quota rules
- Complexity of judgment aggregation
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
- Computational Complexity
- Dogson's rule and Yong's rule
- Exact analysis of Dodgson elections
- Exact complexity of the winner problem for Young elections
- Extending Condorcet's rule
- Generalizations of Opt P to the polynomial hierarchy
- Handbook of computational social choice
- How hard is it to compute majority-preserving judgment aggregation rules?
- Independence of clones as a criterion for voting rules
- Introduction to judgment aggregation
- Judgment aggregation
- Judgment aggregation and the problem of tracking the truth
- Judgment aggregation without full rationality
- Lifting integrity constraints in binary aggregation
- Logic and structure
- Logical constraints on judgement aggregation
- Majority rule in the absence of a majority
- Measuring dissimilarity between judgment sets
- Merging Information Under Constraints: A Logical Framework
- Methods for distance-based judgment aggregation
- On the hardness of maximum rank aggregation problems
- On truth-table reducibility to SAT
- Ontology merging as social choice: judgment aggregation under the open world assumption
- Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
- Preferred answer sets for extended logic programs
- Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
- Scoring rules for judgment aggregation
- Search versus decision for election manipulation problems
- The Condorcet set: majority voting over interconnected propositions
- The complexity of Kemeny elections
- The complexity of optimization problems
- The complexity of selecting maximal solutions
- The difference and truth-table hierarchies for NP
- The polynomial-time hierarchy
- The premiss-based approach to judgment aggregation
- The strong exponential hierarchy collapses
- The structure of strategy-proof social choice. I: General characterization and possibility results on median spaces
- The theory of judgment aggregation: an introductory review
- Tournament solutions
- Weighted tournament solutions
- \(\text{DA}^2\) merging operators
Cited in
(10)- Strategic manipulation in judgment aggregation under higher-level reasoning
- Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
- How hard is it to compute majority-preserving judgment aggregation rules?
- A general framework for participatory budgeting with additional constraints
- Complexity of judgment aggregation
- Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas
- Control in judgment aggregation
- Declarative approaches to outcome determination in judgment aggregation
- Jérôme Lang's contributions at the interface of economic theory with artificial intelligence
- Collective combinatorial optimisation as judgment aggregation
This page was built for publication: The complexity landscape of outcome determination in judgment aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5139591)
