Un nuevo algoritmo para la resolucion de juegos bimatriciales

DOI10.1007/BF02888259MaRDI QIDQ4022752zbMATH OpenFDO

Authors Luciano Méndez-Naya

Publication date 17 January 1993

Published in Trabajos de Investigacion Operativa (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/40624

zbMATH Keywords

bimatrix games

Mathematics Subject Classification ID

Noncooperative games (91A10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Seeking the equilibrium situations in bimatrix games
• On the exact polynomial time algorithm for a special class of bimatrix game
• scientific article; zbMATH DE number 4118196
• A general method and improvement for computing the solutions of the bimatrix game using Matlab
• A procedure for finding Nash equilibria in bi-matrix games

Cites work

• scientific article; zbMATH DE number 3661140 (Why is no real title available?)
• AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
• Equilibrium Points in Finite Games
• Equilibrium Points of Bimatrix Games
• Una generalizacion de la caracterizacion de puntos extremos

Cited in

(8)

• A general method and improvement for computing the solutions of the bimatrix game using Matlab
• On the exact polynomial time algorithm for a special class of bimatrix game
• Choice of solution in one-step bimatrix games
• Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game
• Random bimatrix games are asymptotically easy to solve (a simple proof)
• scientific article; zbMATH DE number 7235434 (Why is no real title available?)
• Fast Algorithms for Rank-1 Bimatrix Games
• scientific article; zbMATH DE number 4023062 (Why is no real title available?)

This page was built for publication: Un nuevo algoritmo para la resolucion de juegos bimatriciales

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022752)