Games of fixed rank: a hierarchy of bimatrix games (Q847799): Difference between revisions

Latest revision as of 06:07, 10 December 2024

scientific article; zbMATH DE number 6381745

Games of fixed rank: A hierarchy of bimatrix games

Language	Label	Description	Also known as
English	Games of fixed rank: a hierarchy of bimatrix games	scientific article; zbMATH DE number 6381745	Games of fixed rank: A hierarchy of bimatrix games

Statements

instance of

scholarly article

0 references

title

Games of fixed rank: a hierarchy of bimatrix games (English)

0 references

0 references

0 references

0 references

19 February 2010

0 references

18 December 2014

0 references

full work available at URL

https://arxiv.org/abs/cs/0511021

0 references

zbMATH Keywords

bimarix game

0 references

Nash equilibrium

0 references

fixed rank

0 references

approximation

0 references

MaRDI profile type

Publication

0 references

arXiv classification

cs.GT

0 references

math.CO

0 references

cites work

Q3844775

0 references

Matrix Analysis

0 references

On a class of nash-solvable bimatrix games and some related nash subsets

0 references

On the maximal number of Nash equilibria in an \(n\times n\) bimatrix game

0 references

Polynomial algorithms for approximating Nash equilibria of bimatrix games

0 references

Equilibrium Points of Bimatrix Games

0 references

Q3745276

0 references

Equilibrium Points of Bimatrix Games

0 references

Generic \(4\times 4\) two person games have at most 15 Nash equilibria

0 references

Equilibrium points in <i>n</i> -person games

0 references

Non-cooperative games

0 references

Q5844986

0 references

On the complexity of the parity argument and other inefficient proofs of existence

0 references

Algorithms, games, and the internet

0 references

A bound on the number of Nash equilibria in a coordination game.

0 references

New maximal numbers of equilibria in bimatrix games

0 references

Computing Normal Form Perfect Equilibria for Extensive Two-Person Games

0 references

Approximation algorithms for indefinite quadratic programming

0 references

Q4782696

0 references

Identifiers

zbMATH Open document ID

1202.91007

0 references

1303.91011

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

10.1007/S00199-009-0436-2

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:847799

@@ Property / DOI @@
-.1007/s00199-009-0436-2
@@ Property / DOI: 10.1007/s00199-009-0436-2 / rank @@
-Normal rank
@@ Property / cites work @@
+Q3844775
@@ Property / cites work: Q3844775 / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix Analysis
@@ Property / cites work: Matrix Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+On a class of nash-solvable bimatrix games and some related nash subsets
+Normal rank
@@ Property / cites work @@
+On the maximal number of Nash equilibria in an \(n\times n\) bimatrix game
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for approximating Nash equilibria of bimatrix games
+Normal rank
@@ Property / cites work @@
+Equilibrium Points of Bimatrix Games
@@ Property / cites work: Equilibrium Points of Bimatrix Games / rank @@
+Normal rank
@@ Property / cites work @@
+Q3745276
@@ Property / cites work: Q3745276 / rank @@
+Normal rank
@@ Property / cites work @@
+Equilibrium Points of Bimatrix Games
@@ Property / cites work: Equilibrium Points of Bimatrix Games / rank @@
+Normal rank
@@ Property / cites work @@
+Generic \(4\times 4\) two person games have at most 15 Nash equilibria
+Normal rank
@@ Property / cites work @@
+Equilibrium points in             <i>n</i>             -person games
@@ Property / cites work: Equilibrium points in <i>n</i> -person games / rank @@
+Normal rank
@@ Property / cites work @@
+Non-cooperative games
@@ Property / cites work: Non-cooperative games / rank @@
+Normal rank
@@ Property / cites work @@
+Q5844986
@@ Property / cites work: Q5844986 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the parity argument and other inefficient proofs of existence
+Normal rank
@@ Property / cites work @@
+Algorithms, games, and the internet
@@ Property / cites work: Algorithms, games, and the internet / rank @@
+Normal rank
@@ Property / cites work @@
+A bound on the number of Nash equilibria in a coordination game.
+Normal rank
@@ Property / cites work @@
+New maximal numbers of equilibria in bimatrix games
+Normal rank
@@ Property / cites work @@
+Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for indefinite quadratic programming
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00199-009-0436-2
@@ Property / DOI: 10.1007/S00199-009-0436-2 / rank @@
+Normal rank