How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation

DOI10.1007/978-3-642-24873-3_1zbMATH Open1233.91077OpenAlexW144297625MaRDI QIDQ3095285FDOQ3095285

Authors: Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe 

Publication date: 28 October 2011

Published in: Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24873-3_1

Recommendations

• Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
• Complexity of bribery and control for uniform premise-based quota rules under various preference types
• Complexity of judgment aggregation
• How hard is bribery in elections?
• Complexity of control in judgment aggregation for uniform premise-based quota rules

Mathematics Subject Classification ID

Decision theory (91B06) Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12)

Cited In (5)

• The logic of group decisions: judgment aggregation
• Pervasive domination
• Complexity of control in judgment aggregation for uniform premise-based quota rules
• Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
• Simulation of Bribes and Consequences of Leniency Policy. Results from an Experimental Study

This page was built for publication: How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation

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