Computability of simple games: a complete investigation of the sixty-four possibilities
From MaRDI portal
Publication:553522
DOI10.1016/j.jmateco.2010.12.003zbMath1222.91017arXiv1102.4037WikidataQ56387528 ScholiaQ56387528MaRDI QIDQ553522
H. Reiju Mihara, Masahiro Kumabe
Publication date: 27 July 2011
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.4037
Related Items
Computability of simple games: a complete investigation of the sixty-four possibilities, The Nakamura numbers for computable simple games, Computability of simple games: A characterization and application to the core
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preference aggregation theory without acyclicity: the core without majority dissatisfaction
- Computability of simple games: a complete investigation of the sixty-four possibilities
- The Nakamura numbers for computable simple games
- Social choice and computational complexity
- An infinite version of Arrow's theorem in the effective setting
- Voting schemes for which it can be difficult to tell who won the election
- Classical recursion theory. The theory of functions and sets of natural numbers.
- Arrow's theorem and Turing computability
- Nonanonymity and sensitivity of computable simple games
- The computational difficulty of manipulating an election
- Arrow's theorem, countably many agents, and more visible invisible dictators
- On the axiomatic method and its recent applications to game theory and resource allocation
- Computability of simple games: A characterization and application to the core
- Undescribable Events
- A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision
- A Note on the Complete Independence of the Conditions for Simple Majority Decision
