Global Search and Local Ascent for Large Cournot Games

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...

Full description

Saved in:
Bibliographic Details
Published in:Studia Universitatis Babeș-Bolyai. Informatica Vol. 55; no. 4; pp. 85 - 92
Main Authors: Maria Sarasan, Tudor Dan Mihoc, Rodica Ioana Lung, Dumitru Dumitrescu
Format: Journal Article
Language:English
Published: Babes-Bolyai University, Cluj-Napoca 01-12-2010
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1224-869X