Equilibria detection in large games is a fundamental problem in computational game theory. A memetic algorithm, Global Search and Local Ascent (GSLA), is proposed. GSLA's performance is evaluated by means of numerical experiments within the framework of a Cournot game involving up to 100 players and by comparison with an evolutionary multiobjective optimization algorithm adapted for Nash equilibria detection
Abstract—Much current research in AI and games is being devoted to Monte Carlo search (MCS) algorith...
This paper provides an overview of different approaches for handling extensive games. It focuses on ...
This chapter arises from the discussions of an experienced international group of researchers intere...
The computation of a Nash equilibrium in a game is a chal-lenging problem in artificial intelligence...
A problem of competition between the three largest banks of the Mongolia major crediting sector is i...
... games is a challenging work due to existence of local Nash equilibrium traps. So, devising algor...
This paper proposed a novel method to determine which individuals can enter from the first search ph...
Abstract. Computing equilibria of multiplayer noncooperative normal form games is a difficult comput...
In this article, a new genetic algorithm (GA), called the Nash equilibrium sorting genetic algorithm...
Many approaches that model specific intelligent behaviors perform excellently in solving complex opt...
In a graphical game agents play with their neighbors on a graph to achieve an appropriate state of e...
Nash equilibrium constitutes a central solution concept in game theory. The task of detecting the Na...
This paper considers the application of a novel optimization method, namely Par-ticle Swarm Optimiza...
AbstractNash equilibrium constitutes a central solution concept in game theory. The task of detectin...
Abstract. We present two new algorithms for computing Nash equilibria of stochastic games. One is a ...
Abstract—Much current research in AI and games is being devoted to Monte Carlo search (MCS) algorith...
This paper provides an overview of different approaches for handling extensive games. It focuses on ...
This chapter arises from the discussions of an experienced international group of researchers intere...
The computation of a Nash equilibrium in a game is a chal-lenging problem in artificial intelligence...
A problem of competition between the three largest banks of the Mongolia major crediting sector is i...
... games is a challenging work due to existence of local Nash equilibrium traps. So, devising algor...
This paper proposed a novel method to determine which individuals can enter from the first search ph...
Abstract. Computing equilibria of multiplayer noncooperative normal form games is a difficult comput...
In this article, a new genetic algorithm (GA), called the Nash equilibrium sorting genetic algorithm...
Many approaches that model specific intelligent behaviors perform excellently in solving complex opt...
In a graphical game agents play with their neighbors on a graph to achieve an appropriate state of e...
Nash equilibrium constitutes a central solution concept in game theory. The task of detecting the Na...
This paper considers the application of a novel optimization method, namely Par-ticle Swarm Optimiza...
AbstractNash equilibrium constitutes a central solution concept in game theory. The task of detectin...
Abstract. We present two new algorithms for computing Nash equilibria of stochastic games. One is a ...
Abstract—Much current research in AI and games is being devoted to Monte Carlo search (MCS) algorith...
This paper provides an overview of different approaches for handling extensive games. It focuses on ...
This chapter arises from the discussions of an experienced international group of researchers intere...