Pages that link to "Item:Q1038709"
From MaRDI portal
The following pages link to The Nakamura numbers for computable simple games (Q1038709):
Displaying 5 items.
- Computational complexity in the design of voting rules (Q256771) (← links)
- Preference aggregation theory without acyclicity: the core without majority dissatisfaction (Q536092) (← links)
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- Bounds for the Nakamura number (Q2417421) (← links)
- Computability of simple games: A characterization and application to the core (Q2482640) (← links)
