Un nuevo algoritmo para la resolucion de juegos bimatriciales

DOI10.1007/BF02888259zbMATH Open0759.90100MaRDI QIDQ4022752FDOQ4022752

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)

Cites Work

• Equilibrium Points of Bimatrix Games
• AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
• Equilibrium Points in Finite Games
• Title not available (Why is that?)
• Una generalizacion de la caracterizacion de puntos extremos

Cited In (5)

• Title not available (Why is that?)
• Fast Algorithms for Rank-1 Bimatrix Games
• Random bimatrix games are asymptotically easy to solve (a simple proof)
• Title not available (Why is that?)
• Choice of solution in one-step bimatrix games

   Recommendations

• Seeking the equilibrium situations in bimatrix games 👍 👎
• On the exact polynomial time algorithm for a special class of bimatrix game 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)