Undecidability of the existence of pure Nash equilibria (Journal article)

Sofronidis, N.


Full metadata record
DC FieldValueLanguage
dc.contributor.authorSofronidis, N.en
dc.date.accessioned2015-11-24T17:04:17Z-
dc.date.available2015-11-24T17:04:17Z-
dc.identifier.urihttp://olympias.lib.uoi.gr/jspui/handle/123456789/11152-
dc.rightsDefault Licence-
dc.subjectUndecidable problemsen
dc.subjectNon-cooperative gamesen
dc.titleUndecidability of the existence of pure Nash equilibriaen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Οικονομικών και Κοινωνικών Επιστημών. Τμήμα Οικονομικών Επιστημώνel
heal.publicationDate2004-
heal.abstractThe purpose of this paper is to show that for any positive integer n, there exists no algorithm which decides for each non-cooperative n-person game in strategic form with partially computable payoff functions whether it has a pure Nash equilibrium or not.en
heal.journalNameEconomic Theoryen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Files in This Item:
There are no files associated with this item.



 Please use this identifier to cite or link to this item:
http://olympias.lib.uoi.gr/jspui/handle/123456789/11152
  This item is a favorite for 0 people.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.