Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/11152Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Σωφρονίδης, Νικόλαος Ε. | el |
| dc.date.accessioned | 2015-11-24T17:04:17Z | - |
| dc.date.available | 2015-11-24T17:04:17Z | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/11152 | - |
| dc.rights | Default Licence | - |
| dc.subject | Undecidable problems | en |
| dc.subject | Non-cooperative games | en |
| dc.title | Undecidability of the existence of pure Nash equilibria | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Οικονομικών και Κοινωνικών Επιστημών. Τμήμα Οικονομικών Επιστημών | el |
| heal.publicationDate | 2004 | - |
| heal.abstract | The 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.journalName | Economic Theory | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) - ΟΕ | |
Files in This Item:
There are no files associated with this item.
This item is licensed under a Creative Commons License
