Pages that link to "Item:Q918448"
From MaRDI portal
The following pages link to NP-completeness of some problems concerning voting games (Q918448):
Displaying 26 items.
- Computational complexity in the design of voting rules (Q256771) (← links)
- On the complexity of exchanging (Q264207) (← links)
- Manipulating the quota in weighted voting games (Q420828) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- Confidence intervals for the Shapley-Shubik power index in Markovian games (Q471433) (← links)
- A relation-algebraic approach to simple games (Q631101) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
- The complexity of power-index comparison (Q1001906) (← links)
- Computability, complexity and economics (Q1318305) (← links)
- Easy weighted majority games (Q1590151) (← links)
- Analyzing power in weighted voting games with super-increasing weights (Q1733386) (← links)
- Faster algorithms for computing power indices in weighted voting games (Q1779724) (← links)
- On the use of binary decision diagrams for solving problems on simple games (Q1926964) (← links)
- Voting power on a graph connected political space with an application to decision-making in the council of the European Union (Q2068879) (← links)
- Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games (Q2070558) (← links)
- Monte Carlo methods for the Shapley-Shubik power index (Q2091694) (← links)
- Structural control in weighted voting games (Q2098945) (← links)
- On the computational complexity of weighted voting games (Q2268913) (← links)
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Some open problems in simple games (Q2854004) (← links)
- A Note on the Owen Value for Glove Games (Q3459307) (← links)
- Variable Influences in Conjunctive Normal Forms (Q3637162) (← links)
- On the complexity of problems on simple games (Q5388151) (← links)
- Complexity of computing the Shapley value in partition function form games (Q6488801) (← links)
