Pages that link to "Item:Q918448"
From MaRDI portal
The following pages link to NP-completeness of some problems concerning voting games (Q918448):
Displayed 9 items.
- A relation-algebraic approach to simple games (Q631101) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- The complexity of power-index comparison (Q1001906) (← links)
- Computability, complexity and economics (Q1318305) (← links)
- Easy weighted majority games (Q1590151) (← links)
- Faster algorithms for computing power indices in weighted voting games (Q1779724) (← links)
- On the computational complexity of weighted voting games (Q2268913) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Variable Influences in Conjunctive Normal Forms (Q3637162) (← links)