Global Search and Local Ascent for Large Cournot Games
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 player...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Babes-Bolyai University, Cluj-Napoca
2010-12-01
|
| Series: | Studia Universitatis Babes-Bolyai: Series Informatica |
| Online Access: | http://www.cs.ubbcluj.ro/apps/reviste/index.php/studia-i/article/view/8 |