AN ALGORITHM FOR DETERMINING A CLASS OF TWO-PERSON GAMES HAVING A PURE-STRATEGY NASH EQUILIBRIUM - Collections

＜journal article＞
AN ALGORITHM FOR DETERMINING A CLASS OF TWO-PERSON GAMES HAVING A PURE-STRATEGY NASH EQUILIBRIUM

Creator	Creator Name Sato, Jun-ichi 佐藤, 潤一 Affiliation Affiliation Name Collaborative Research Team for Verification, National Institute of Advanced Industrial Science and Technology (AIST) 産業技術総合研究所産学官連携部門
Creator	Author PID L002490 Creator Name Ito, Takahiro 伊藤, 隆浩 Affiliation Affiliation Name Graduate School of Mathematics, Kyushu University 九州大学大学院数理学府
Language	English
Publisher	Research Association of Statistical Sciences
Publisher	統計科学研究会
Date	2009-12
Source Title	Bulletin of informatics and cybernetics
Vol	41
First Page	51
Last Page	58
Publication Type	Version of Record
Access Rights	open access
Crossref DOI	https://doi.org/10.5109/21046
Related DOI	http://bic.math.kyushu-u.ac.jp/
Related URI	http://bic.math.kyushu-u.ac.jp/
Relation	http://bic.math.kyushu-u.ac.jp/
Abstract	Sato and Kawasaki (Preprint) introduced a class of n-person games called partially monotone games, and showed that any partially monotone game has a pure-strategy Nash equilibrium. Further, they prove...d that partial monotonicity is necessary for the existence of a pure-strategy Nash equilibrium in the case of two persons. In this paper, we present an algorithm for determining whether a two-person game belongs to the class. Our algorithm requires O(m^2n^2) time, where m and n are the number of pure strategies of players 1 and 2, respectively.show more

File	FileType	Size	Views	Description
p051	pdf	104 KB	420

PISSN	0286-522X
NCID	AA10634475
Record ID	21046
Peer-Reviewed	Refereed
Subject Terms	pure strategy
	Nash equilibrium
	monotonicity of the best responses
Type	学術雑誌論文
Created Date	2012.03.14
Modified Date	2023.12.12