A minimax theorem

A minimax theorem is proved, under a continuity condition complementing the celebrated von Neumann–Sion's minimax theorem. The result is based on an intersection theorem which may be of interest on its own right.     

A general minimax theorem

This paper is concerned with minimax theorems for two-person zero-sum games (X, Y, f) with payofff and as main result the minimax equality inf supf (x, y)=sup inff (x, y) is obtained under a new condition onf. This condition is based on the concept of averaging functions, i.e. real-valued functions defined on some subset of the plane with min {x, y}< (x, y)x, y} forx y and (x, x)=x. After establishing some simple facts on averaging functions, we prove a minimax theorem for payoffsf with the following property: Forf there exist averaging functions and such that for any x₁, x₂ X, > 0 there exists x₀ X withf (x₀, y) > f (x₁,y),f (x₂,y))– for ally Y, and for any y₁, y₂ Y, > 0 there exists y₀ Y withf (x, y₀) (f (x, y₁),f (x, y₂))+. This result contains as a special case the Fan-König result for concave-convex-like payoffs in a general version, when we take linear averaging with (x, y)=x+(1–)y, (x, y)=x+(1–)y, 0 <, < 1.Then a class of hide-and-seek games is introduced, and we derive conditions for applying the minimax result of this paper.

---

Zusammenfassung In dieser Arbeit werden Minimaxsätze für Zwei-Personen-Nullsummenspiele (X, Y,f) mit Auszahlungsfunktionf behandelt, und als Hauptresultat wird die Gültigkeit der Minimaxgleichung inf supf (x, y)=sup inff (x, y) unter einer neuen Bedingung an f nachgewiesen. Diese Bedingung basiert auf dem Konzept mittelnder Funktionen, d.h. reellwertiger Funktionen, welche auf einer Teilmenge der Ebene definiert sind und dort der Eigenschaft min {x, y} < < (x, y)x, y} fürx y, (x, x)=x, genügen. Nach der Herleitung einiger einfacher Aussagen über mittelnde Funktionen beweisen wir einen Minimaxsatz für Auszahlungsfunktionenf mit folgender Eigenschaft: Zuf existieren mittelnde Funktionen und, so daß zu beliebigen x₁, x₂ X, > 0 mindestens ein x₀ X existiert mitf (x₀,y) (f (x ₁,y),f (x₂,y)) – für alley Y und zu beliebigen y₁, y₂ Y, > 0 mindestens ein y₀ Y existiert mitf (x, y₀) (f (x, y₁),f (x, y ₂))+ für allex X. Dieses Resultat enthält als Spezialfall den Fan-König'schen Minimaxsatz für konkav-konvev-ähnliche Auszahlungsfunktionen in einer allgemeinen Version, wenn wir lineare Mittelung mit (x, y)=x+(1–)y, (x, y)= x+(1–)y, 0 <, < 1, betrachten.Es wird eine Klasse von Suchspielen eingeführt, welche mit dem vorstehenden Resultat behandelt werden können.

     

A general two-function minimax theorem

A two-function minimax theorem is proved. In this result, the concavity-convexity conditions of both functions involve monotone transforms and mixing of functional values, and the ＂w- upwardness/w-downwardness＂ conditions; both spaces are required to be compact topological spaces but without linear structure. By this result, an open question proposed by Forgo and Joo in 1998 is answered.     

A minimax theorem for vector-valued functions

In this work, as usual in vector-valued optimization, we consider the partial ordering induced in a topological vector space by a closed and convex cone. In this way, we define maximal and minimal sets of a vector-valued function and consider minimax problems in this setting. Under suitable hypotheses (continuity, compactness, and special types of convexity), we prove that, for every $$\alpha \varepsilon Max\bigcup\limits_{s\varepsilon X_o } {Min_w } f(s,Y_0 ),$$ there exists $$\beta \varepsilon Min\bigcup\limits_{r\varepsilon Y_o } {Max} f(X_0 ,t),$$ such that β ≤ α (the exact meanings of the symbols are given in Section 2).     

A minimax theorem on circuits in projective graphs

A minimax theorem is proved. The theorem concerns packing non-separating circuits in eulerian graphs embedded in the projective plane. The proof includes a polynomial algorithm which produces a collection of edge-disjoint, non-separating circuits of the same cardinality as a transversal of such circuits.     

A solvability theorem and minimax fractional programming

This paper presents a stable solvability theorem for general inequality systems under a local closedness condition. It is shown how this mild regularity condition can be characterized by the validity of the solvability theorem for all local perturbations. Based on this solvability theorem zero duality gap and stability are established for general minimax fractional programming problems.The research was initiated while the first named author was a visitor at the University of New South Wales and was completed while the second named author was a visitor at the Technische Hochschule Darmstadt.     

A general sufficiency theorem for minimax control

This paper considers optimal control problems where there is uncertainty in the differential equations describing the system. A minimax optimality criterion is used, and sufficient conditions for a control to be a minimax control are presented. These conditions are more general than those given in Refs. 1 and 2.This research was supported by AFOSR under Grant No. 76-2923.     

A new topological minimax theorem with application

A new topological minimax theorem is established for functions on C×\mathbb R{C\times \mathbb R} where C is a topological space. Although this theorem includes as special cases most important recent results on this subject, its proof is surprisingly simple. An application to nonlinear optimization theory is considered.     

A symmetric minimax theorem without linear structure

Archiv der Mathematik -     

A generalization of a minimax theorem of Fan via a theorem of the alternative

A minimization problem for a functional on a convex subsetC of a normed linear space is considered. Under certain hypotheses, optimality in a certain subset ofC implies the validity of first-order necessary optimality conditions for the problem inC. The result is applied to a problem in optimal periodic control of neutral functional differential equations.This work was partially supported by a grant from Deutsche Forschungsgemeinschaft and by AFOSR under Grant No. AFOSR-84-0398.     

A minimax theorem for vector-valued functions in lexicographic order

In this paper, a minimax theorem and a saddle point theorem are obtained for vector-valued functions in the sense of lexicographic order, respectively. An equivalent relationship between the minimax inequality and the saddle point is established. Some examples are given to illustrate our results.     

A lifting theorem for unbounded quasinormal operators

Relationships between minimal normal extensions of spectral and cyclic type of an unbounded quasinormal operator are discussed and some properties such as, for example, tightness of such extensions are established. A Yoshino type criterion on the lifting of the strong commutant of an unbounded quasinormal operator is proved.