Well supported approximate equilibria in bimatrix games (Q973002): Difference between revisions

The authors study a new notion of approximate Nash equilibria, with the first polynomial time algorithm for its construction in normalized and win lose bimatrix games.

0 references

reviewed by

Vasile Postolică

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

bimatrix games

0 references

well supported approximate Nash equilibria

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00453-008-9227-6

0 references

OpenAlex ID

W2107285505

0 references

cites work

A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games

0 references

On sparse approximations to randomized strategies and convex combinations

0 references

Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming

0 references

New algorithms for approximate Nash equilibria in bimatrix games

0 references

New complexity results about Nash equilibria

0 references

Algorithms – ESA 2005

0 references

The complexity of computing a Nash equilibrium

0 references

A note on approximate Nash equilibria

0 references

Reducibility among equilibrium problems

0 references

Games of fixed rank: a hierarchy of bimatrix games

0 references

Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach

0 references

Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games

0 references

Polynomial algorithms for approximating Nash equilibria of bimatrix games

0 references

Equilibrium Points of Bimatrix Games

0 references

Non-cooperative games

0 references

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

0 references

Algorithms, games, and the internet

0 references

Hard-to-Solve Bimatrix Games

0 references

An Optimization Approach for Approximate Nash Equilibria

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:973002

@@ Property / cites work @@
+A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
+Normal rank
@@ Property / cites work @@
+On sparse approximations to randomized strategies and convex combinations
+Normal rank
@@ Property / cites work @@
+Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
+Normal rank
@@ Property / cites work @@
+New algorithms for approximate Nash equilibria in bimatrix games
+Normal rank
@@ Property / cites work @@
+New complexity results about Nash equilibria
@@ Property / cites work: New complexity results about Nash equilibria / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing a Nash equilibrium
@@ Property / cites work: The complexity of computing a Nash equilibrium / rank @@
+Normal rank
@@ Property / cites work @@
+A note on approximate Nash equilibria
@@ Property / cites work: A note on approximate Nash equilibria / rank @@
+Normal rank
@@ Property / cites work @@
+Nash and correlated equilibria: Some complexity considerations
+Normal rank
@@ Property / cites work @@
+Reducibility among equilibrium problems
@@ Property / cites work: Reducibility among equilibrium problems / rank @@
+Normal rank
@@ Property / cites work @@
+Games of fixed rank: a hierarchy of bimatrix games
+Normal rank
@@ Property / cites work @@
+Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
+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 @@
+Non-cooperative games
@@ Property / cites work: Non-cooperative games / 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 @@
+Hard-to-Solve Bimatrix Games
@@ Property / cites work: Hard-to-Solve Bimatrix Games / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimization Approach for Approximate Nash Equilibria
+Normal rank