Approximate Equilibria for Strategic Two Person Games
From MaRDI portal
Publication:5459968
Recommendations
Cites work
- A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
- Algorithms, games, and the internet
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
- Equilibrium Points of Bimatrix Games
- Hard-to-Solve Bimatrix Games
- Nash and correlated equilibria: Some complexity considerations
- Non-cooperative games
- On sparse approximations to randomized strategies and convex combinations
- On the complexity of the parity argument and other inefficient proofs of existence
- Reducibility among equilibrium problems
- The complexity of computing a Nash equilibrium
- Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
Cited in
(8)- Two-Person Ratio Efficiency Games
- A note on anti-Nash equilibrium for bimatrix game
- Equilibria, fixed points, and complexity classes
- scientific article; zbMATH DE number 1534505 (Why is no real title available?)
- New algorithms for approximate Nash equilibria in bimatrix games
- A two-stage Bertrand-Edgeworth game
- Optimal values and strategies for a particular case of two-person games
- Two game-theoretic problems of approach
This page was built for publication: Approximate Equilibria for Strategic Two Person Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459968)