Computability of simple games: A characterization and application to the core (Q2482640): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56060514, #quickstatements; #temporary_batch_1706897434465 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56060514 / rank | |||
Normal rank | |||
Revision as of 22:44, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computability of simple games: A characterization and application to the core |
scientific article |
Statements
Computability of simple games: A characterization and application to the core (English)
0 references
23 April 2008
0 references
voting games
0 references
infinitely many players
0 references
recursion theory
0 references
Turing computability
0 references
computable manuals and contracts
0 references
