Approximate Equilibria for Strategic Two Person Games (Q5459968)

scientific article; zbMATH DE number 5270396

Language	Label	Description	Also known as
English	Approximate Equilibria for Strategic Two Person Games	scientific article; zbMATH DE number 5270396

Statements

instance of

scholarly article

0 references

title

Approximate Equilibria for Strategic Two Person Games (English)

0 references

published in

Algorithmic Game Theory

0 references

publication date

2 May 2008

0 references

author

Paul G. Spirakis

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-79309-0_3

0 references

cites work

On sparse approximations to randomized strategies and convex combinations

0 references

The complexity of computing a Nash equilibrium

0 references

Reducibility among equilibrium problems

0 references

Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games

0 references

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

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

A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem

0 references

Identifiers

zbMATH Open document ID

1136.91307

0 references

DOI

10.1007/978-3-540-79309-0_3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5459968