Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies

DOI10.1016/j.amc.2014.11.039zbMath1328.91009OpenAlexW2008957913MaRDI QIDQ903026

Kazem Nogondarian, Mohammad Mahdi Mohtadi

Publication date: 4 January 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.11.039

zbMATH Keywords

game theorymixed strategycomputing Nash equilibriumbig problemsgame solver algorithm (GSA)static game

Mathematics Subject Classification ID

2-person games (91A05)

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Collective behavior and evolutionary games -- an introduction
• Reinterpreting mixed strategy equilibria: a unification of the classical and Bayesian views
• Simple search methods for finding a Nash equilibrium
• A parametric representation of totally mixed Nash equilibria
• Efficient computation of behavior strategies
• An overview of bilevel optimization
• Rewarding evolutionary fitness with links between populations promotes cooperation
• Essentials of Game Theory: A Concise Multidisciplinary Introduction
• Equilibrium Points in Nonzero-Sum n-Person Submodular Games
• Equilibrium points in n -person games

This page was built for publication: Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies