Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Annibal Parracho Sant'Anna / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 91B12 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 91B06 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 91A40 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5933149 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
voting games | |||
Property / zbMATH Keywords: voting games / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
computability | |||
Property / zbMATH Keywords: computability / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
complete independence | |||
Property / zbMATH Keywords: complete independence / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2129074646 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56387528 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1102.4037 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Undescribable Events / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2783476 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Voting schemes for which it can be difficult to tell who won the election / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The computational difficulty of manipulating an election / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Social choice and computational complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computability of simple games: a complete investigation of the sixty-four possibilities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computability of simple games: A characterization and application to the core / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Nakamura numbers for computable simple games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preference aggregation theory without acyclicity: the core without majority dissatisfaction / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An infinite version of Arrow's theorem in the effective setting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Note on the Complete Independence of the Conditions for Simple Majority Decision / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arrow's theorem and Turing computability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arrow's theorem, countably many agents, and more visible invisible dictators / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonanonymity and sensitivity of computable simple games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3819052 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the axiomatic method and its recent applications to game theory and resource allocation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4220401 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
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