Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522): Difference between revisions

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.