Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types

DOI10.1007/978-3-319-23114-3_26zbMath1405.91144OpenAlexW2296078588MaRDI QIDQ3449548

Jörg Rothe, Ann-Kathrin Selker, Dorothea Baumeister

Publication date: 4 November 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-23114-3_26

zbMATH Keywords

controlcomputational complexityjudgment aggregationbribery

Mathematics Subject Classification ID

Voting theory (91B12) Individual preferences (91B08) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters ⋮ Complexity of control in judgment aggregation for uniform premise-based quota rules

This page was built for publication: Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types