Pages that link to "Item:Q1101310"
From MaRDI portal
The following pages link to Social choice and computational complexity (Q1101310):
Displayed 6 items.
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- The Nakamura numbers for computable simple games (Q1038709) (← links)
- Computability and randomness of Nash equilibrium in infinite games (Q1177225) (← links)
- On the difficulty of making social choices (Q1891667) (← links)
- Arrow's theorem, countably many agents, and more visible invisible dictators (Q1961954) (← links)
- Computability of simple games: A characterization and application to the core (Q2482640) (← links)