Non-convex infinite games

DOI10.1080/02331938808843344zbMath0657.90101OpenAlexW2020261768MaRDI QIDQ3807018

Vaithilingam Jeyakumar

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938808843344

zbMATH Keywords

minimax theoremtheorem of the alternativeexistence of optimal strategiesfinite valueinfinite number of strategiesnonconvex infinite games

Mathematics Subject Classification ID

2-person games (91A05)

Related Items (2)

Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Inequality systems and optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of a minimax theorem of Fan via a theorem of the alternative
• Convex semi-infinite games
• Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem
• Closed images of convex multivalued mappings in linear topological spaces with applications
• On systems of convex inequalities
• On infinite systems of linear inequalities
• The theory of infinite games
• Closedness conditions for the optimality of a family of non-convex optimization problems
• Convexlike alternative theorems and mathematical programming
• A Semi-Infinite Game
• Convex Analysis
• Minimax Theorems

This page was built for publication: Non-convex infinite games