In this paper, we prove that, under full rank, every perfect public equilibrium payoff (above some Nash equilibrium in the two-player case, and above the minmax payoff with more players) can be achieved with strategies that have bounded memory. This result is then used to prove that feasible, individually rational payoffs (above some strict Nash equilibrium in the two-player case, and above the...

I Basic Results on Normal Form Games 3 I.1 The Minmax Theorem 4 I.1.a Definitions and Notations 4 I.1.b A Basic Theorem 5 I.1.c Convexity 6 I.1.d Mixed Strategies 6 I.1.e Note on the Separation Theorem 9 Exercises 10 I.2 Complements to the Minmax Theorem 15 I.2.a The Topology on S 16 I.2.b Lack of Continuity: Regularization 16 I.2.c Lack of Compactness: Approximation 19 I.2.d Measurability: Sym...

In this paper we present an appropriate singular, zero-sum, linear-quadratic differential game. One of the main features game is that weight matrix minimizer’s control cost in functional singular. Due to singularity, cannot be solved either by applying Isaacs MinMax principle, or Bellman–Isaacs equation approach. As application, introduced interception with regularized and developed dual repres...

Afriat’s original method of proof is restored by using the minmax theorem.

Skipping mechanisms have been extensively studied to improve query performance over large data volumes. A powerful skipping technique for in-memory columnar databases is partition elimination. The goal is to eliminate, as much as possible, loading physically partitioned data into memory and probing column partitions against queries. This is achieved by consulting column partition summaries. The...

In this paper, we consider the rate-distortion optimal encoding of shape information using a skeleton decomposition and the minmum maximum (MINMAX) distortion criterion. For bit budget constrained video communication applications, whose goal is to achieve as low as possible but almost constant distortion, the MINMAX criterion is the natural choice. We propose a 4D DAG (directed acyclic graph) s...

In this paper, we consider the minmax product rate variation problem (PRVP), which consists in sequencing copies of different products on an assembly line in such a way that the maximum value of a discrepancy function between actual and ideal productions is minimum. One means of solving this problem lies in its reduction to a bottleneck assignment problem with a matrix of a special structure. T...