Existence of solutions of games with some non-convexity (Q1090255): Difference between revisions

Some inf-sup and saddle point theorems are proved for functions \(f: Y\to {\mathbb{R}}\) \((=reals)\). The general theorems weaken some of the convexity conditions that are usually imposed on X, Y, and f. Some special cases are considered - these results impose some convexity in the hypotheses but still treat situations not covered by classical theorems.