A minmax theorem for concave-convex mappings with no regularity assumptions

MaRDI QIDQ5262226zbMATH OpenFDO

Authors Vianney Perchet, Guillaume Vigeral

Publication date 13 July 2015

Full work available at URL http://www.heldermann.de/JCA/JCA22/JCA222/jca22025.htm

zbMATH Keywords

concave-convex mappingsminmax theoremzero-sum games

Mathematics Subject Classification ID

Existence of solutions for minimax problems (49J35) Optimality conditions for minimax problems (49K35)

Recommendations

• scientific article; zbMATH DE number 3915069
• Minimax theorems for set-valued maps without continuity assumptions
• Non-convex infinite games
• Criterion for complete determinacy for concave-convexlike games
• An extension of Sion's minimax theorem with an application to a method for constrained games

Cited in

(8)

• Continuity of equilibria for two-person zero-sum games with noncompact action sets and unbounded payoffs
• Deviation results for sparse tables in hashing with linear probing
• A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
• scientific article; zbMATH DE number 1594508 (Why is no real title available?)
• Adjustable robust optimization with objective uncertainty
• Solutions for zero‐sum two‐player games with noncompact decision sets and unbounded payoffs
• Exact approaches for convex adjustable robust optimization
• Criterion for complete determinacy for concave-convexlike games

This page was built for publication: A minmax theorem for concave-convex mappings with no regularity assumptions

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