scientific article; zbMATH DE number 4023062
From MaRDI portal
Publication:3765577
Recommendations
- scientific article; zbMATH DE number 3847256
- Un nuevo algoritmo para la resolucion de juegos bimatriciales
- Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games
- An algorithm for finding approximate Nash equilibria in bimatrix games
- Numerical search for the equilibria in bimatrix games
- COMPUTATION OF COMPLETELY MIXED EQUILIBRIUM PAYOFFS IN BIMATRIX GAMES
- Seeking the equilibrium situations in bimatrix games
- New algorithms for approximate Nash equilibria in bimatrix games
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Cited in
(11)- Seeking the equilibrium situations in bimatrix games
- A finite step algorithm via a bimatrix game to a single controller non- zero sum stochastic game
- On the convergence of the Lemke-Howson algorithm for bi-matrix games
- scientific article; zbMATH DE number 3847256 (Why is no real title available?)
- A general method and improvement for computing the solutions of the bimatrix game using Matlab
- A web-based bimatrix game optimization model of polynomial complexity
- scientific article; zbMATH DE number 1372122 (Why is no real title available?)
- scientific article; zbMATH DE number 21095 (Why is no real title available?)
- Some matrix techniques in game theory
- scientific article; zbMATH DE number 3892974 (Why is no real title available?)
- Numerical search for the equilibria in bimatrix games
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765577)
