In this note we review some known minimax theorems with applications in game theory and show that these results form an equivalent chain which includes the strong separation result in finite dimensional spaces between two disjoint closed convex sets of which one is compact. By simplifying the...

In this paper we introduce a new class of OR games: economic lot-sizing (ELS) games. There are a number of retailers that have a known demand for a fixed number of periods. To satisfy demand the retailers order products at the same manufacturer. By placing joint orders instead of individual...

In the first chapter of this book the basic results within convex and quasiconvex analysis are presented. In Section 2 we consider in detail the algebraic and topological properties of convex sets within Rn together with their primal and dual representations. In Section 3 we apply the results...

In this paper we review known minimax results with applications ingame theory and show that these results are easy consequences of thefirst minimax result for a two person zero sum game with finite strategysets published by von Neumann in 1928: Among these results are thewell known minimax...

In this paper the well-known minimax theorems of Wald, Ville and Von Neumann are generalized under weaker topological conditions on the payoff function f and/or extended to the larger set of the Borel probability measures instead of the set of mixed strategies

In this paper we discuss the level set method of Joo and how to use it to give an elementary proof of the well-known Sion's minimax result. Although this proof technique is initiated by Joo and based on the inter-section of upper level sets and a clever use of the topological notion of...

The paper reports laboratory experiments on a day-to-day route choice game with two routes. Subjects had to choose between a main road M and a side road S. The capacity was greater for the main road. 18 subjects participated in each session. In equilibrium the number of subjects is 12 on M and 6...