How hard is it to compute majority-preserving judgment aggregation rules?

MaRDI QIDQ5283014zbMATH OpenFDO

Authors Jérôme Lang, Marija Slavkovik

Publication date 18 July 2017

Full work available at URL http://ebooks.iospress.nl/volumearticle/36990

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42)

Recommendations

• Complexity of judgment aggregation
• The complexity landscape of outcome determination in judgment aggregation
• A partial taxonomy of judgment aggregation rules and their properties
• Social choice and computational complexity
• Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation

Cited in

(7)

• A partial taxonomy of judgment aggregation rules and their properties
• Complexity of judgment aggregation
• Aggregating probabilistic judgments
• The complexity landscape of outcome determination in judgment aggregation
• Graph aggregation
• Declarative approaches to outcome determination in judgment aggregation
• Jérôme Lang's contributions at the interface of economic theory with artificial intelligence

This page was built for publication: How hard is it to compute majority-preserving judgment aggregation rules?

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