Results 1  10
of
1,066,003
On a MinMax Theorem of Cacti
, 1997
"... A simple proof is presented for the minmax theorem of Lov'asz on cacti. Instead of using the result of Lov'asz on matroid parity, we shall apply twice the (conceptionally simpler) matroid intersection theorem. 1 Introduction The graph matching problem and the matroid intersection problem ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A simple proof is presented for the minmax theorem of Lov'asz on cacti. Instead of using the result of Lov'asz on matroid parity, we shall apply twice the (conceptionally simpler) matroid intersection theorem. 1 Introduction The graph matching problem and the matroid intersection
On Stabilization of MinMax Systems
"... This note studies minmax systems which are dynamic systems involving three operations (min,max,+). We present a feedback stabilization policy such that the closedloop systems have a global cycle time which is the same as the maximal Lyapunov exponent of the openloop systems for a class of min ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This note studies minmax systems which are dynamic systems involving three operations (min,max,+). We present a feedback stabilization policy such that the closedloop systems have a global cycle time which is the same as the maximal Lyapunov exponent of the openloop systems for a class of minmax
Dynamics of MinMax Functions
, 1997
"... Functions F : R n ! R n which are nonexpansive in the ` 1 norm and homogeneous, F i (x 1 + h; \Delta \Delta \Delta ; xn + h) = F i (x 1 ; \Delta \Delta \Delta ; xn ) + h, (socalled topical functions) have appeared recently in the work of several authors. They include (after suitable transforma ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
transformation) nonnegative matrices, Leontieff substitution systems, Bellman operators of games and of Markov decisions processes, examples arising from discrete event systems (digital circuits, computer networks, etc) and the minmax functions studied in this paper. Any topical function F can be approximated
MINMAX FOR SWEEPOUTS BY CURVES
, 2007
"... Given a Riemannian metric on the 2sphere, sweep the 2sphere out by a continuous oneparameter family of closed curves starting and ending at point curves. Pull the sweepout tight by, in a continuous way, pulling each curve as tight as possible yet preserving the sweepout. We show the following usef ..."
Dynamic MinMax Problems
 Swiss Federal Institute of Technology (ETH Zurich), TIK (Computer Engineering and Networks Laboratory
, 1997
"... In this paper we address minmax equations for periodic and nonperiodic problems. In the nonperiodic case a simple algorithm is presented to determine whether a graph has a potential satisfying the minmax equations. This method can also be used to solve a more general minmax problem on periodic g ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this paper we address minmax equations for periodic and nonperiodic problems. In the nonperiodic case a simple algorithm is presented to determine whether a graph has a potential satisfying the minmax equations. This method can also be used to solve a more general minmax problem on periodic
Computation of the MinMax Measure
, 1998
"... The MinMax measure of information, defined by Kapur, Baciu and Kesavan [6], is a quantitative measure of the information contained in a given set of moment constraints. It is based on both maximum and minimum entropy. Computational difficulties in the determination of minimum entropy probability dis ..."
Abstract
 Add to MetaCart
The MinMax measure of information, defined by Kapur, Baciu and Kesavan [6], is a quantitative measure of the information contained in a given set of moment constraints. It is based on both maximum and minimum entropy. Computational difficulties in the determination of minimum entropy probability
1Minmax
"... fair coordinated beamforming in cellular systems via large systems analysis ..."
Abstract
 Add to MetaCart
fair coordinated beamforming in cellular systems via large systems analysis
Minimal EdgeCoverings of Pairs of Sets
, 1995
"... A new minmax theorem concerning bisupermodular functions on pairs of sets is proved. As a special case, we derive an extension of (A. Lubiw's extension of) E. Györi's theorem on intervals, W. Mader's theorem on splitting off edges in directed graphs, J. Edmonds' theorem on matr ..."
Abstract

Cited by 68 (15 self)
 Add to MetaCart
A new minmax theorem concerning bisupermodular functions on pairs of sets is proved. As a special case, we derive an extension of (A. Lubiw's extension of) E. Györi's theorem on intervals, W. Mader's theorem on splitting off edges in directed graphs, J. Edmonds' theorem
A Uniform MinMax Theorem with Applications in Cryptography
, 2013
"... We present a new, more constructive proof of von Neumann’s MinMax Theorem for twoplayer zerosum game — specifically, an algorithm that builds a nearoptimal mixed strategy for the second player from several bestresponses of the second player to mixed strategies of the first player. The algorithm ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We present a new, more constructive proof of von Neumann’s MinMax Theorem for twoplayer zerosum game — specifically, an algorithm that builds a nearoptimal mixed strategy for the second player from several bestresponses of the second player to mixed strategies of the first player. The algorithm
Results 1  10
of
1,066,003