Results 171 to 180 of about 757 (200)
Some of the next articles are maybe not open access.
1983
In this chapter, we study 2-person normal form games, zero-sum games (matrix games) as well as nonzero-sum games (bimatrix games). It is our objective to investigate whether, for the special case of a 2-person game, the results of the previous chapter can be refined and specialized.
openaire +1 more source
In this chapter, we study 2-person normal form games, zero-sum games (matrix games) as well as nonzero-sum games (bimatrix games). It is our objective to investigate whether, for the special case of a 2-person game, the results of the previous chapter can be refined and specialized.
openaire +1 more source
2000
Das Funktionspaket GameTheory‘Bimatrix’ fast samtliche, im Text entwickelten Algorithmen zur Bestimmung bzw. Auswahl von spieltheoretischen Gleichgewichten zusammen. Es wird mit dem Befehl $$ < < GameTheory'Bimatrix' $$ in ein Mathematica- Notebook geladen.
openaire +1 more source
Das Funktionspaket GameTheory‘Bimatrix’ fast samtliche, im Text entwickelten Algorithmen zur Bestimmung bzw. Auswahl von spieltheoretischen Gleichgewichten zusammen. Es wird mit dem Befehl $$ < < GameTheory'Bimatrix' $$ in ein Mathematica- Notebook geladen.
openaire +1 more source
Maximal nash subsets for bimatrix games
Naval Research Logistics Quarterly, 1981AbstractIn this work maximal Nash subsets are studied in order to show that the set of equilibrium points of a bimatrix game is the finite union of all such subsets. In addition, the extreme points of maximal Nash subsets are characterized in terms of square submatrices of the payoff matrices and dimension relations are derived.
openaire +1 more source
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games
ACM Transactions on Algorithms, 2023Argyrios Deligkas +2 more
exaly
Rationality of the information exchange in bimatrix games
Kybernetika, 1985The author quantifies the value of several instances of information exchange between the players in a bimatrix game, using the notion of ``guarantee strategies''. These are mixed strategies which will guarantee each player a minimal return no matter what the other does. ``Values'' for each player are then defined which are analogous to ``the value'' of
openaire +2 more sources
Fast Algorithms for Rank-1 Bimatrix Games
Operations Research, 2021Bharat Adsul, Jugal Garg, Ruta Mehta
exaly
Computing mixed NE in bimatrix games in randomized polynomial time
Soft Computing, 2023Lunshan Gao
exaly
Extended matrix norm method: Applications to bimatrix games and convergence results
Applied Mathematics and Computation, 2023Burhaneddin İzgi +2 more
exaly