The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 4 / 2010  
         
  Article:   GLOBAL SEARCH AND LOCAL ASCENT FOR LARGE COURNOT GAMES.

Authors:  TUDOR DAN MIHOC, RODICA IOANA LUNG, D. 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.

 

Key words and phrases. Nash equilibrium, generative relation for equilibria, large nonzero games.

 
         
     
         
         
      Back to previous page