… As usual in zero-sum problems, we assume that k is a multiple of p, since otherwise M(p,
k) … matrix whose elements all equal one has no square submatrix of order k which is zero-sum …

… In case the payoff is a square matrix it can be shown that when one player has on optimal
strategy which is not completely mixed then his opponent also possesses an optimal strategy …

… are concerned with central matrices, and a new notion, closely related to sign-centrality. We
call a ( ± 1 ) -matrix A a ZSC-matrix (zero sum sign-central) if each matrix with the same sign …

… This implies that the correlation device gives no advantage to either player in zero-sum
matrix garnes. In this case, we say that the game has no good correlated equilibrium. We call a …

… about the mass matrix, we present some details of the mass matrices that produce the mixing
… In conclusion, we have studied the consequences of neutrino masses with the ‘‘zero sum’’ …

… zero sum matrix game by using matrix norms. Especially, we show how to obtain approximated
game value for any zero sum matrix … on the matrix norms of the payoff matrix and some …

… zero-sum large matchings and zero-sum graphs of the form \(tH\) , where \(H\) is a fixed
graph. The main distinction here is that in zero-sum Ramsey theory we cannot get a zero-sum …

… We next analyze phenomenologically the mass texture we obtain by modifying the Zee
mass matrix by a trace-less diagonal perturbation matrix. We show that this mass matrix can …

… zero-sum game models the case where players’ interests are completely opposed [27]. As a
special case of that game, the two-person zero-sum matrix game, short for the matrix … matrix …

… We consider linear-quadratic, two-person, zero-sum perfect information differential games, …
final state case, we know that there exists a matrix W(t) such that, for all capturing controls, …