A Theory of N -Person Games with Perfect Information
From MaRDI portal
Publication:5817850
DOI10.1073/pnas.39.6.496zbMath0050.14008OpenAlexW2126464708WikidataQ33713582 ScholiaQ33713582MaRDI QIDQ5817850
Publication date: 1953
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.39.6.496
Related Items
DETERMINACY AND INDETERMINACY OF GAMES PLAYED ON COMPLETE METRIC SPACES, The power of paradox: some recent developments in interactive epistemology, Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles, On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games, Lexicographic agreeing to disagree and perfect equilibrium, Unique stable matchings, [https://portal.mardi4nfdi.de/wiki/Publication:5675574 Unverschr�nkte Graphen und strategische Spiele in kombinatorischer Form], Nash-solvable two-person symmetric cycle game forms, Chess-like games may have no uniform Nash equilibria even in mixed strategies, Playing in the first Baire class, A three-person deterministic graphical game without Nash equilibria, Iterative information update and stability of strategies, On the existence of pure strategy Nash equilibria in two person discrete games, Combinatorial games modeling seki in Go, Non-cooperative stochastic dominance games, On the inconsistency of certain axioms on solution concepts for non- cooperative games, Bipartite choices, Decision-making by an authority under influence, Iterated weak dominance in strictly competitive games of perfect information.
