Computability of simple games: A characterization and application to the core (Q2482640): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Incomplete Written Contracts: Undescribable States of Nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperation and Effective Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the core of voting games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arrow's theorem with restricted coalition algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precisely dictatorial social welfare functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic social choice from finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Social choice and electoral competition in the general spatial model / 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: Rationality, Computability, and Nash Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5737081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Cooperative Solution Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperation and Punishment / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computational complexity of membership test in flow games and linear production games / rank
 
Normal rank
Property / cites work
 
Property / cites work: May's theorem with an infinite population / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymity in large societies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Social choice and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimally generated Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567860 / 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: Computability of simple games: a complete investigation of the sixty-four possibilities / 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: An infinite version of Arrow's theorem in the effective setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymity and neutrality in Arrow's Theorem with restricted coalition algebras / 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: Existence of a coalitionally strategyproof social choice function: a constructive proof / 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: The vetoers in a simple game with ordinal preferences / 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: On the computability of Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable preference and utility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-computability of competitive equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Rational Expectations Under Computability Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity in the design of voting rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting games and acyclic collective choice rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Solution Concept for Coalitional Games in Open Anonymous Environments / rank
 
Normal rank

Latest revision as of 22:06, 27 June 2024

scientific article
Language Label Description Also known as
English
Computability of simple games: A characterization and application to the core
scientific article

    Statements

    Computability of simple games: A characterization and application to the core (English)
    0 references
    0 references
    0 references
    23 April 2008
    0 references
    0 references
    voting games
    0 references
    infinitely many players
    0 references
    recursion theory
    0 references
    Turing computability
    0 references
    computable manuals and contracts
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references