Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522): Difference between revisions
From MaRDI portal
Latest revision as of 08:58, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computability of simple games: a complete investigation of the sixty-four possibilities |
scientific article |
Statements
Computability of simple games: a complete investigation of the sixty-four possibilities (English)
0 references
27 July 2011
0 references
For voting games, this paper discusses the notion of of algorithmic computability. With this concept is formulated in terms of existence of a finite algorithm able to decide from any description of each coalition whether it is a winning or a losing coalition, the authors investigate its independence to the May concepts of monotonicity, properness, strongness and nonweakness. Independence, in the sense of May, is proven within the class of infinite games.
0 references
voting games
0 references
computability
0 references
complete independence
0 references
0 references
0 references
0 references