NP-completeness of some problems concerning voting games
From MaRDI portal
Publication:918448
DOI10.1007/BF01753703zbMath0705.90103MaRDI QIDQ918448
Publication date: 1990
Published in: International Journal of Game Theory (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Cooperative games (91A12) Voting theory (91B12) Social choice (91B14)
Related Items (23)
A Note on the Owen Value for Glove Games ⋮ On the use of binary decision diagrams for solving problems on simple games ⋮ The complexity of power indexes with graph restricted coalitions ⋮ Manipulating the quota in weighted voting games ⋮ A relation-algebraic approach to simple games ⋮ The consequences of eliminating NP solutions ⋮ On the complexity of core, kernel, and bargaining set ⋮ Confidence intervals for the Shapley-Shubik power index in Markovian games ⋮ On the complexity of problems on simple games ⋮ Analyzing power in weighted voting games with super-increasing weights ⋮ Open problems around exact algorithms ⋮ On the computational complexity of weighted voting games ⋮ Faster algorithms for computing power indices in weighted voting games ⋮ The complexity of power-index comparison ⋮ Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value ⋮ Variable Influences in Conjunctive Normal Forms ⋮ Voting power on a graph connected political space with an application to decision-making in the council of the European Union ⋮ Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games ⋮ SOME OPEN PROBLEMS IN SIMPLE GAMES ⋮ Monte Carlo methods for the Shapley-Shubik power index ⋮ Easy weighted majority games ⋮ Structural control in weighted voting games ⋮ Computability, complexity and economics
Cites Work
This page was built for publication: NP-completeness of some problems concerning voting games
