Nonanonymity and sensitivity of computable simple games (Q1763192)
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 2136104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonanonymity and sensitivity of computable simple games |
scientific article; zbMATH DE number 2136104 |
Statements
Nonanonymity and sensitivity of computable simple games (English)
0 references
22 February 2005
0 references
Voting games
0 references
Infinitely many players
0 references
Ultrafilters
0 references
Recursion theory
0 references
Turing
0 references
0.8877094388008118
0 references
0.8763235807418823
0 references
0.8748206496238708
0 references
0.7871975302696228
0 references
0.7596514225006104
0 references
