We propose an O(min{m+n logn,m log∗n}) to find a minmax strongly connected spanning subgraph of a digraph with n nodes and m arcs. A generalization of this problem called the minmax strongly connected subgraph problem with node penalties is also considered. An O(m logn) algorithm is proposed to solve this general problem. We also discuss ways to improve the average complexity of this algorithm.

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

Cyclotomic constructions are given for several infinite families of even length binary sequences, which have optimal or near-optimal negaperiodic autocorrelation. It appears that two of the constructions have an asymptotic Merit Factor of 6.0 which is very high. Mappings from periodic to negaperiodic autocorrelation are also discussed.

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

Cyclotomic constructions are given for several infinite families of even length binary sequences which have low negaperiodic autocorrelation. It appears that two of the constructions have asymptotic Merit Factor 6.0 which is very high. Mappings from periodic to negaperiodic autocorrelation are also discussed.

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

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

Considering the minmax programming problem, lower and upper subdifferential optimality conditions, in the sense of Mordukhovich, are derived. The approach here, mainly based on the nonsmooth dual objects of Mordukhovich, is completely different from that of most of the previous works where generalizations of the alternative theorem of Farkas have been applied. The results obtained are closed to...