Counting stable strategies in random evolutionary games

dc.contributor.authorKontogiannis, S.en
dc.contributor.authorSpirakis, P.en
dc.date.accessioned2015-11-24T17:01:00Z
dc.date.available2015-11-24T17:01:00Z
dc.identifier.issn0302-9743-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10854
dc.rightsDefault Licence-
dc.subjectdynamicsen
dc.subjectnumberen
dc.titleCounting stable strategies in random evolutionary gamesen
heal.abstractIn this paper we study the notion of the Evolutionary Stable Strategies (ESS) in evolutionary games and we demonstrate their qualitative difference from the Nash Equilibria, by showing that a random evolutionary game has on average exponentially less number of ESS than the number of Nash Equilibria in the underlying symmetric 2-person game with random payoffs.en
heal.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.journalNameAlgorithms and Computationen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate2005-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.typejournalArticle-
heal.type.elΆρθρο Περιοδικούel
heal.type.enJournal articleen

Αρχεία

Φάκελος/Πακέτο αδειών

Προβολή: 1 - 1 of 1
Φόρτωση...
Μικρογραφία εικόνας
Ονομα:
license.txt
Μέγεθος:
1.74 KB
Μορφότυπο:
Item-specific license agreed upon to submission
Περιγραφή: