Finding saddle points on polyhedra: Solving certain continuous minimax problems

DOI10.1002/(SICI)1520-6750(199609)43:6%3C821::AID-NAV3%3E3.0.CO;2-6zbMATH Open0857.90121OpenAlexW2080306410MaRDI QIDQ4715982FDOQ4715982

Authors: George E. Monahan 

Publication date: 20 February 1997

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199609)43:6%3C821::aid-nav3%3E3.0.co;2-6

Recommendations

• Optimal strategies for a two-person zero sum game and saddle-points of the scalar field associated with the game
• scientific article; zbMATH DE number 4197780
• Finding a saddle point in antagonistic games
• Vector saddle-point and distributed parameter differential games
• scientific article; zbMATH DE number 3939130

zbMATH Keywords

saddle pointscontinuous concave-functionsmarket-share attraction games

Mathematics Subject Classification ID

Nonlinear programming (90C30) 2-person games (91A05)

Cited In (3)

• A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
• Restrictions on the saddle-point solution in the game of teamball
• A continuous algorithm for finding the saddle points of convex-concave functions

This page was built for publication: Finding saddle points on polyhedra: Solving certain continuous minimax problems

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