Generalization of a theorem by v. Neumann concerning zero sum two person games

DOI10.2307/1969023zbMATH Open0063.08127OpenAlexW2326092873WikidataQ97709859 ScholiaQ97709859MaRDI QIDQ2653380FDOQ2653380

Authors: A. Wald 

Publication date: 1945

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1969023

Cited In (20)

• The Minmax Theorem for U.S.C.-L.S.C. payoff functions
• Elementary convex techniques for equilibrium, minimax and variational problems
• Nash equilibria and values through modular partitions in infinite games
• A generalization of a classical zero-sum problem
• On linear programming duality and necessary and sufficient conditions in minimax theory
• On the minimax theorem of the theory of game
• Focused estimation for noisy and small data sets: a Bayesian minimum expected loss estimator approach
• Existence of equilibria in countable games: an algebraic approach
• On the existence of values for arbitration games
• John von Neumann’s work in the theory of games and mathematical economics
• Legitimate equilibrium
• Oblivious algorithms for the maximum directed cut problem
• Infinite zero-sum two-person games
• On equivalent results in minimax theory
• On the determinateness of semi-infinite bimatrix games
• Minimax theorems for interval spaces
• On Borel probability measures and noncooperative game theory
• On a generalized sup-inf problem
• Approximate equilibria for Bayesian games
• Zero-sum games with charges

This page was built for publication: Generalization of a theorem by v. Neumann concerning zero sum two person games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2653380)