A proof of the existence of φ-stable sets in N-player games via Glicksberg's fixed point theorem Online publication date: Fri, 17-Mar-2017
by Shravan Luckraz
Asian J. of Management Science and Applications (AJMSA), Vol. 2, No. 4, 2016
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the Asian J. of Management Science and Applications (AJMSA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com