Skip to main content
Article thumbnail
Location of Repository

Global Search and Local Ascent for Large Cournot Games

By Maria Sarasan, Tudor Dan Mihoc, Rodica Ioana Lung and Dumitru Dumitrescu

Abstract

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

Topics: Electronic computers. Computer science, QA75.5-76.95, Instruments and machines, QA71-90, Mathematics, QA1-939, Science, Q, DOAJ:Computer Science, DOAJ:Technology and Engineering
Publisher: Babes-Bolyai University, Cluj-Napoca
Year: 2010
OAI identifier: oai:doaj.org/article:23ae195d828f4301929157d4996348c5
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://doaj.org/toc/1224-869X (external link)
  • http://www.cs.ubbcluj.ro/apps/... (external link)
  • https://doaj.org/article/23ae1... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.