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

zbMATH Open1366.68342MaRDI QIDQ5283014FDOQ5283014

Authors: Jérôme Lang, Marija Slavkovik 

Publication date: 18 July 2017

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

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

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42)

Cited In (5)

• The complexity landscape of outcome determination in judgment aggregation
• Complexity of judgment aggregation
• A partial taxonomy of judgment aggregation rules and their properties
• Graph aggregation
• Title not available (Why is that?)

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)