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...

This paper focuses on the problem of monotone decision trees from the point of view of the multicriteria decision aid methodology (MCDA). By taking into account the preferences of the decision maker, an attempt is made to bring closer similar research within machine learning and MCDA. The paper...

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

A theoretical model is adopted in order to explain incentives and actual safety behaviour for drivers, pedestrians and other road users which do not utilise motorised vehicles. A road user's outcome is supposed to be dependent on her individual actions and cares decided upon by other individuals...