Munich Personal RePEc Archive
metadata only
The Nakamura numbers for computable simple games
The Nakamura number of a simple game plays a critical role in preference aggregation (or multi-criterion ranking): the number of alternatives that the players can always deal with rationally is less than this number. We comprehensively study the restrictions that various properties for a simple game
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Nakamura numbers for computable simple games#1275609
- Computability of simple games: A complete investigation of the sixty-four possibilities#499701
- Correlated Perfect Equilibrium#1248297
- Social choice and game theory: recent results with a topological approach#1277818
- The Mathematics of Lottery: Odds, Combinations, Systems#698397
Record · ID 1276630
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive