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_1zbMath1233.91077OpenAlexW144297625MaRDI QIDQ3095285

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

Mathematics Subject Classification ID

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

Related Items (4)

The logic of group decisions: judgment aggregation ⋮ 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 ⋮ Pervasive domination

This page was built for publication: How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation