Finding Saddlepoints of Two-Person, Zero Sum Games

DOI10.2307/2322384zbMATH Open0664.90096OpenAlexW2313602694MaRDI QIDQ3815892FDOQ3815892

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

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

zbMATH Keywords

worst case complexitystrict saddlepoint

Mathematics Subject Classification ID

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

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)