An extension of Sion's minimax theorem with an application to a method for constrained games
DOI10.2140/PJM.1982.103.401zbMATH Open0534.49009OpenAlexW2014252818MaRDI QIDQ790412FDOQ790412
Authors: Joachim Hartung
Publication date: 1982
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1982.103.401
Recommendations
two-person zero-sum gamesminimax theorem for quasi-concave-convex functionssup inf-compact conditions
Nonlinear programming (90C30) 2-person games (91A05) Game theory (91A99) Methods involving semicontinuity and convergence; relaxation (49J45) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Special maps on topological spaces (open, closed, perfect, etc.) (54C10) Existence of solutions for minimax problems (49J35) Existence theories for problems in abstract spaces (49J27)
Cited In (22)
- Recession maps and applications
- Minimax representation of nonexpansive functions and application to zero-sum recursive games
- Sion's minimax theorem and Nash equilibrium of symmetric three-players zero-sum game
- Some topological properties of the solution sets of parametrized minimax problems
- An algorithm for minimax
- A matrix-free trust-region Newton algorithm for convex-constrained optimization
- Title not available (Why is that?)
- Generalized Cochran-Wald statistics in combining of experiments
- Optimal shape and location of sensors for parabolic equations with random initial data
- A hadamard-stable extension of courant's sequential method for convex extremal problems
- Title not available (Why is that?)
- Inheritance of convexity for the \(\mathcal{P}_{\min}\)-restricted game
- Extensions of two minimax theorems of S. Park
- Non-convex infinite games
- Title not available (Why is that?)
- Minimax theorems in probabilistic metric spaces
- On a minimax theorem of Terkelsen's
- Gradient methods for constrained maxima
- Minimax results for semicoercive functionals with application to differential equations
- A minmax theorem for concave-convex mappings with no regularity assumptions
- First steps in constructive game theory
- Existence theorems for cone saddle points of vector-valued functions in infinite-dimensional spaces
This page was built for publication: An extension of Sion's minimax theorem with an application to a method for constrained games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790412)