In this paper, we prove that the concept of value traditionally defined in the class of two-person zero-sum games can be adequately generalized to the class of n-person weakly unilaterally competitive games introduced by Kats & Thisse [KT92b]. We subsequently establish that if there exists an equilibrium in a game belonging to the latter class, then every player possesses at least an optimal strategy (i.e., a strategy yielding at least the value to this player). Furthermore, we show that, in all unilaterally competitive games that have a Nash equilibrium profile, a strategy profile is an equilibrium if and only if it is an optimal profile. From these results, we deduce a very strong foundation to the Nash equilibrium concept in unilaterally...
We analyze a Colonel Blotto game in which opposing parties have differing relative intensities (i.e....
and computational complexity • non-cooperative game theory provides elegant models and solution con...
We prove a generalization of von Neumann's minmax theorem to the class of separable multiplayer zero...
Some properties of zero-sum games are extended to different classes of two-person non zero-sum game...
We show that in zero-sum polymatrix games, a multiplayer generalization of two-person zero-sum games...
In this article, we analyze how reasonable it is to play according to some Nash equilibria if player...
In many games, it is desirable to find strategies for all players that simultaneously maximize their...
AbstractIn this paper we provide a logical framework for two-person finite games in strategic form, ...
We suggest that extending Muller games with preference ordering for players is a natural way to reas...
A single period, zero-sum, multi-player game is constructed. Each player can either exit the game fo...
In the zero-sum (non-zero sum) completely mixed game each player has only one optimal (equilibrium) ...
A PhD Dissertation, presented as part of the requirements for the Degree of Doctor of Philosophy fro...
We study a rather simplified game model of competition for status. Each player chooses a scalar vari...
In this article, we analyze how reasonable it is to play according to some Nash equilibria if player...
This paper is concerned both with the comparative geometry of Nash and correlated equilibria, and wi...
We analyze a Colonel Blotto game in which opposing parties have differing relative intensities (i.e....
and computational complexity • non-cooperative game theory provides elegant models and solution con...
We prove a generalization of von Neumann's minmax theorem to the class of separable multiplayer zero...
Some properties of zero-sum games are extended to different classes of two-person non zero-sum game...
We show that in zero-sum polymatrix games, a multiplayer generalization of two-person zero-sum games...
In this article, we analyze how reasonable it is to play according to some Nash equilibria if player...
In many games, it is desirable to find strategies for all players that simultaneously maximize their...
AbstractIn this paper we provide a logical framework for two-person finite games in strategic form, ...
We suggest that extending Muller games with preference ordering for players is a natural way to reas...
A single period, zero-sum, multi-player game is constructed. Each player can either exit the game fo...
In the zero-sum (non-zero sum) completely mixed game each player has only one optimal (equilibrium) ...
A PhD Dissertation, presented as part of the requirements for the Degree of Doctor of Philosophy fro...
We study a rather simplified game model of competition for status. Each player chooses a scalar vari...
In this article, we analyze how reasonable it is to play according to some Nash equilibria if player...
This paper is concerned both with the comparative geometry of Nash and correlated equilibria, and wi...
We analyze a Colonel Blotto game in which opposing parties have differing relative intensities (i.e....
and computational complexity • non-cooperative game theory provides elegant models and solution con...
We prove a generalization of von Neumann's minmax theorem to the class of separable multiplayer zero...