Guaranteed results in games with forbidden situations
Consider a Cournot game with 2 players, deploying strategies x and y respectively. In addition to the usual setup, the game has a coupled constraint, such as \(x + y \leq 1\). The paper gives an upper bound for the maximin value of this game to a player. An example shows that the maximin may exceed the minimax.
scientific article; zbMATH DE number 5637672