A proof of the existence of φ-stable sets in N-player games via Glicksberg's fixed point theorem

Shravan Luckraz

doi:10.1504/AJMSA.2016.082958

A proof of the existence of φ-stable sets in N-player games via Glicksberg's fixed point theorem

Research output: Journal Publication › Article › peer-review

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	https://doi.org/10.1504/AJMSA.2016.082958
Publication status	Published - Mar 2017

Keywords

Glicksberg
fixed point theorem
phi-stable sets
finite games
mixed extensions

Access to Document

10.1504/AJMSA.2016.082958Licence: Unspecified

Cite this

@article{d294f0119e8d4181aa4935fedc3b912a,

title = "A proof of the existence of φ-stable sets in N-player games via Glicksberg's fixed point theorem",

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.",

keywords = "Glicksberg, fixed point theorem, phi-stable sets, finite games, mixed extensions",

author = "Shravan Luckraz",

year = "2017",

month = mar,

doi = "10.1504/AJMSA.2016.082958",

language = "English",

volume = "2",

pages = "356--364",

journal = "Asian Journal of Management Science and Applications",

issn = "2049-8691",

number = "4",

}

TY - JOUR

T1 - A proof of the existence of φ-stable sets in N-player games via Glicksberg's fixed point theorem

AU - Luckraz, Shravan

PY - 2017/3

Y1 - 2017/3

N2 - 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.

AB - 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.

KW - Glicksberg

KW - fixed point theorem

KW - phi-stable sets

KW - finite games

KW - mixed extensions

U2 - 10.1504/AJMSA.2016.082958

DO - 10.1504/AJMSA.2016.082958

M3 - Article

SN - 2049-8691

VL - 2

SP - 356

EP - 364

JO - Asian Journal of Management Science and Applications

JF - Asian Journal of Management Science and Applications

IS - 4

ER -

A proof of the existence of φ-stable sets in N-player games via Glicksberg's fixed point theorem

Abstract

Keywords

Access to Document

Fingerprint

Cite this