scientific article
From MaRDI portal
Publication:3093654
zbMath1234.68391arXiv1007.5114MaRDI QIDQ3093654
No author found.
Publication date: 18 October 2011
Full work available at URL: https://arxiv.org/abs/1007.5114
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Agent technology and artificial intelligence (68T42)
Related Items (11)
Isomorphic Distances Among Elections ⋮ The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters ⋮ Manipulation complexity of same-system runoff elections ⋮ Normalized range voting broadly resists control ⋮ On the complexity of bribery and manipulation in tournaments with uncertain information ⋮ On the likelihood of single-peaked preferences ⋮ Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules ⋮ Is computational complexity a barrier to manipulation? ⋮ Complexity of manipulation with partial information in voting ⋮ A parameterized perspective on protecting elections ⋮ Complexity of shift bribery for iterative voting rules
This page was built for publication:
