Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation

DOI10.3233/978-1-61499-672-9-1502MaRDI QIDQ4576258zbMATH OpenOpenAlexFDO

Authors Ronald de Haan

Publication date 12 July 2018

Full work available at URL http://dblp.uni-trier.de/db/conf/ecai/ecai2016.html#Haan16

Mathematics Subject Classification ID

Social choice (91B14) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Complexity of judgment aggregation
• Strategyproof and efficient preference aggregation with Kemeny-based criteria
• Complexity of control in judgment aggregation for uniform premise-based quota rules
• Improved parameterized algorithms for the Kemeny aggregation problem
• scientific article; zbMATH DE number 5543094
• On the computational complexity of non-dictatorial aggregation
• On the computational complexity of non-dictatorial aggregation
• A partial taxonomy of judgment aggregation rules and their properties
• The complexity landscape of outcome determination in judgment aggregation

Cited in

(4)

• The complexity landscape of outcome determination in judgment aggregation
• How hard is it to compute majority-preserving judgment aggregation rules?
• Complexity of control in judgment aggregation for uniform premise-based quota rules
• Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas

This page was built for publication: Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576258)