On the uniqueness of optimal strategies in symmetric matrix games

DOI10.1016/j.laa.2014.03.027zbMath1290.91013OpenAlexW2077840660MaRDI QIDQ2451671

Robert E. Stanford

Publication date: 4 June 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2014.03.027

zbMATH Keywords

game theoryuniquenessoptimal strategiessymmetric matrix games

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence behavior of interior-point algorithms
• Uniqueness of solution in linear programming
• Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
• Recovering an optimal LP basis from an interior point solution
• The use of the optimal partition in a linear programming solution for postoptimal analysis
• A theorem on symmetric two-player zero-sum games
• An iterative method of solving a game
• Iterative solution of matrix games using grid variational inequalities
• On the Convergence of the Mizuno--Todd--Ye Algorithm to the Analytic Center of the Solution Set
• Multiagent Systems
• Games with Discontinuous Payoffs
• On Finding Primal- and Dual-Optimal Bases
• On Effectively Computing the Analytic Center of the Solution Set by Primal-Dual Interior-Point Methods
• A new kind of fictitious play
• On the uniqueness of solutions to linear programs
• Game Theory