It has been shown that two-person zero-sum separable games are associated with a maximization problem involving the cones and dual cones of the generalized moments of the players' mixed strategy sets. In this note it is observed that those results extend almost immediately to two-person nonzero-sum separable games, but that the n-person extension does not follow except in a special case
A balancing game is a perfect information two-person game. Given a set V C R&, in the zth round ...
Two-person zero-sum stochastic games are considered under the long-run average expected payoff crite...
AbstractIn this paper we consider n-person games in which each player has a convex strategy set over...
In the zero-sum (non-zero sum) completely mixed game each player has only one optimal (equilibrium) ...
AbstractIt is shown that a necessary and sufficient condition that a point be a Nash equilibrium poi...
AbstractA 2-person zero-sum game with the payoff function being a sum of two linear functions and a ...
Let A and B be given convex closed bounded nonempty subsets in a Hilbert space H; let the first play...
In this paper, we review the development of studies on multiobjective noncooperative games, and part...
Since the seminal paper of Nash (1950) game theoretic literature has focused mostly on equilibrium a...
We explain the concept and theory behind game theory and simulation. How game theory can be used to ...
In general, consideration of the non-cooperative case of a two-person non-zero-sum game leads to a m...
AbstractMotivated by pursuit evasion differential game, we investigate an abstract two-person zero-s...
We introduce and study the class of semidefinite games, which generalizes bimatrix games and finite ...
In this paper, we propose new solution concepts for multicriteria games and compare them with existi...
For two-person zero-sum games, where the probability of each player winning is a continuous function...
A balancing game is a perfect information two-person game. Given a set V C R&, in the zth round ...
Two-person zero-sum stochastic games are considered under the long-run average expected payoff crite...
AbstractIn this paper we consider n-person games in which each player has a convex strategy set over...
In the zero-sum (non-zero sum) completely mixed game each player has only one optimal (equilibrium) ...
AbstractIt is shown that a necessary and sufficient condition that a point be a Nash equilibrium poi...
AbstractA 2-person zero-sum game with the payoff function being a sum of two linear functions and a ...
Let A and B be given convex closed bounded nonempty subsets in a Hilbert space H; let the first play...
In this paper, we review the development of studies on multiobjective noncooperative games, and part...
Since the seminal paper of Nash (1950) game theoretic literature has focused mostly on equilibrium a...
We explain the concept and theory behind game theory and simulation. How game theory can be used to ...
In general, consideration of the non-cooperative case of a two-person non-zero-sum game leads to a m...
AbstractMotivated by pursuit evasion differential game, we investigate an abstract two-person zero-s...
We introduce and study the class of semidefinite games, which generalizes bimatrix games and finite ...
In this paper, we propose new solution concepts for multicriteria games and compare them with existi...
For two-person zero-sum games, where the probability of each player winning is a continuous function...
A balancing game is a perfect information two-person game. Given a set V C R&, in the zth round ...
Two-person zero-sum stochastic games are considered under the long-run average expected payoff crite...
AbstractIn this paper we consider n-person games in which each player has a convex strategy set over...
DOI
Add to ORKG