Abstract
It is shown that if we represent the widely studied class of finite games with mixed extensions by some general abstract system, then the existence of a non-empty phi-stable set follows from Glicksberg's fixed point theorem.
| Original language | English |
|---|---|
| Pages (from-to) | 356-364 |
| Journal | Asian Journal of Management Science and Applications |
| Volume | 2 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - Mar 2017 |
Free Keywords
- Glicksberg
- fixed point theorem
- phi-stable sets
- finite games
- mixed extensions
Fingerprint
Dive into the research topics of 'A proof of the existence of φ-stable sets in N-player games via Glicksberg's fixed point theorem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver