Finding Saddlepoints of Two-Person, Zero Sum Games

DOI10.2307/2322384MaRDI QIDQ3815892zbMATH OpenOpenAlexFDO

Authors Donna Crystal Llewellyn, Craig A. Tovey, Michael A. Trick

Publication date 1988

Published in The American Mathematical Monthly (Search for Journal in Brave)

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

zbMATH Keywords

worst case complexitystrict saddlepoint

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05)

Recommendations

• A Note on Finding a Strict Saddlepoint
• On some saddle point matrices and applications to completely mixed equilibrium in bimatrix games
• An improved algorithm for finding saddlepoints of two-person zero-sum games
• On some saddle point matrices and applications to completely mixed equilibrium in bimatrix games
• Optimal strategies for a two-person zero sum game and saddle-points of the scalar field associated with the game

Cited in

(6)

• scientific article; zbMATH DE number 21293 (Why is no real title available?)
• scientific article; zbMATH DE number 3205074 (Why is no real title available?)
• scientific article; zbMATH DE number 25178 (Why is no real title available?)
• On incremental approximate saddle-point computation in zero-sum matrix games
• An improved algorithm for finding saddlepoints of two-person zero-sum games
• Optimal strategies for a two-person zero sum game and saddle-points of the scalar field associated with the game

This page was built for publication: Finding Saddlepoints of Two-Person, Zero Sum Games

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