Complexity of judgment aggregation
From MaRDI portal
Abstract: We analyse the computational complexity of three problems in judgment aggregation: (1) computing a collective judgment from a profile of individual judgments (the winner determination problem); (2) deciding whether a given agent can influence the outcome of a judgment aggregation procedure in her favour by reporting insincere judgments (the strategic manipulation problem); and (3) deciding whether a given judgment aggregation scenario is guaranteed to result in a logically consistent outcome, independently from what the judgments supplied by the individuals are (the problem of the safety of the agenda). We provide results both for specific aggregation procedures (the quota rules, the premise-based procedure, and a distance-based procedure) and for classes of aggregation procedures characterised in terms of fundamental axioms.
Recommendations
- How hard is it to compute majority-preserving judgment aggregation rules?
- The complexity landscape of outcome determination in judgment aggregation
- Complexity of control in judgment aggregation for uniform premise-based quota rules
- Consistent judgement aggregation: the truth-functional case
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
Cited in
(39)- On the computational complexity of non-dictatorial aggregation
- Complexity of group identification with partial information
- Structural control in weighted voting games
- Strategic manipulation in judgment aggregation under higher-level reasoning
- Complexity of control in judgment aggregation for uniform premise-based quota rules
- Quota rules for incomplete judgments
- Neutrality and relative acceptability in judgment aggregation
- Optimal truth-tracking rules for the aggregation of incomplete judgments
- Preservation of semantic properties in collective argumentation: the case of aggregating abstract argumentation frameworks
- Strategyproof judgment aggregation under partial information
- Parameterized complexity classes beyond para-NP
- A partial taxonomy of judgment aggregation rules and their properties
- Approximately classic judgement aggregation
- Lifting integrity constraints in binary aggregation
- The logic of group decisions: judgment aggregation
- Computational aspects of manipulation and control in judgment aggregation
- Applications of logic in social choice theory (invited talk)
- Ontology Merging as Social Choice
- How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation
- Introduction to judgment aggregation
- scientific article; zbMATH DE number 7444848 (Why is no real title available?)
- scientific article; zbMATH DE number 5543094 (Why is no real title available?)
- Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
- Iterative judgment aggregation
- Control in judgment aggregation
- Judgement aggregation in non-classical logics
- Preservation of Admissibility with Rationality and Feasibility Constraints
- The complexity landscape of outcome determination in judgment aggregation
- Graph aggregation
- On the computational complexity of non-dictatorial aggregation
- Path-disruption games: bribery and a probabilistic model
- Collective rationality in graph aggregation
- How hard is it to compute majority-preserving judgment aggregation rules?
- Judgment aggregation and agenda manipulation
- Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas
- Declarative approaches to outcome determination in judgment aggregation
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
- Consistent judgement aggregation: the truth-functional case
- Decision framing in judgment aggregation
This page was built for publication: Complexity of judgment aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143579)
