Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/10854
Full metadata record
DC FieldValueLanguage
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.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate2005-
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.journalNameAlgorithms and Computationen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Files in This Item:
File Description SizeFormat 
Kontogiannis-2005-Counting Stable Strategies.pdf198.64 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons