False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time
From MaRDI portal
Publication:5494857
DOI10.1613/jair.4293zbMath1366.68080OpenAlexW2949618724MaRDI QIDQ5494857
Publication date: 30 July 2014
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.4293
Cooperative games (91A12) Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
The excess formulations and related results for the normalized Banzhaf index and the Shapley value ⋮ Controlling weighted voting games by deleting or adding players with or without changing the quota ⋮ Manipulation in communication structures of graph-restricted weighted voting games ⋮ Analyzing power in weighted voting games with super-increasing weights ⋮ Duplication monotonicity in the allocation of indivisible goods ⋮ Control complexity in Borda elections: solving all open cases of offline control and some cases of online control ⋮ Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with an Application to False-name Manipulation ⋮ Path-disruption games: bribery and a probabilistic model ⋮ Analyzing Power in Weighted Voting Games with Super-Increasing Weights ⋮ Structural control in weighted voting games
This page was built for publication: False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time
