Pages that link to "Item:Q5941522"
From MaRDI portal
The following pages link to NP-completeness for calculating power indices of weighted majority games (Q5941522):
Displayed 19 items.
- Proof systems and transformation games (Q354613) (← 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)
- Computing cooperative solution concepts in coalitional skill games (Q490424) (← links)
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams (Q531446) (← links)
- Selfish bin covering (Q650947) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
- The complexity of power-index comparison (Q1001906) (← links)
- Analyzing power in weighted voting games with super-increasing weights (Q1733386) (← links)
- On the computational complexity of weighted voting games (Q2268913) (← links)
- Ranking of decision rules with random power distribution (Q2389765) (← links)
- A cooperative game-theoretic approach to the social ridesharing problem (Q2407882) (← links)
- Equilibrium computation of the Hart and Mas-Colell bargaining model (Q2637848) (← links)
- Analyzing Power in Weighted Voting Games with Super-Increasing Weights (Q2819457) (← links)
- SOME OPEN PROBLEMS IN SIMPLE GAMES (Q2854004) (← links)
- Effort Games and the Price of Myopia (Q3392306) (← links)
- Variable Influences in Conjunctive Normal Forms (Q3637162) (← links)
- On the complexity of problems on simple games (Q5388151) (← links)