| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
| 関連URI |
|
| 関連情報 |
|
| 概要 |
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.続きを見る
|
Mendeley出力
