Computability of simple games: A characterization and application to the core (Q2482640)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5266967
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computability of simple games: A characterization and application to the core |
scientific article; zbMATH DE number 5266967 |
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
0 references
0 references
0 references
0.9068742990493774
0 references
0.8763235807418823
0 references
0.8681589365005493
0 references
0.8520097732543945
0 references
