Pages that link to "Item:Q553522"
From MaRDI portal
The following pages link to Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522):
Displaying 8 items.
- Computational complexity in the design of voting rules (Q256771) (← links)
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- NP-completeness of some problems concerning voting games (Q918448) (← links)
- The Nakamura numbers for computable simple games (Q1038709) (← links)
- Expository notes on computability and complexity in (arithmetical) games (Q1391661) (← links)
- Nonanonymity and sensitivity of computable simple games (Q1763192) (← links)
- On some combinatorial problems arising in the theory of voting games (Q1813696) (← links)
- Computability of simple games: A characterization and application to the core (Q2482640) (← links)