%0 Journal Article
%T Global Search and Local Ascent for Large Cournot Games
%A Maria Sarasan
%A Tudor Dan Mihoc
%A Rodica Ioana Lung
%A Dumitru Dumitrescu
%J Studia Universitatis Babes-Bolyai : Series Informatica
%D 2010
%I Babes-Bolyai University, Cluj-Napoca
%X 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.
%U http://www.cs.ubbcluj.ro/apps/reviste/index.php/studia-i/article/view/8