Modeling Imperfect Information TANHINMIN with Structural Oracle

• Item type: Trans(1)
• 公開日: 2022-01-31
• タイトル: Modeling Imperfect Information TANHINMIN with Structural Oracle
• タイトル / 言語: en
• タイトル: Modeling Imperfect Information TANHINMIN with Structural Oracle
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: [オリジナル論文] imperfect information game, oracle based algorithm, TANHINMIN, winning strategy
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Faculty of Economics, Kyushu University
• 著者所属: Department of Mathematical Informatics, Nagoya University
• 著者所属(英): en
• 著者所属(英): Faculty of Economics, Kyushu University
• 著者所属(英): en
• 著者所属(英): Department of Mathematical Informatics, Nagoya University
• 著者名: Hironori, Kiya; Katsuki, Ohto; Hirotaka, Ono
• 著者名(英): Hironori, Kiya; Katsuki, Ohto; Hirotaka, Ono
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: TANHINMIN is a simplified and perfect information variant of DAIHINMIN, which is major playing card game in Japan. It can be decided in linear time which player has a winning strategy in 2-player TANHINMIN. This paper is concerned with how we obtain a winning strategy for the imperfect information variant of TANHINMIN. If any information about the opponent player's hand is not given at all, it is obviously difficult or impossible to find a winning strategy, though such a hard situation does not likely happen in real game plays; players usually receive some little information about the opponent player's hand through a game such as the number of cards. To handle the situation that a player can receive some information about the opponent player's hand, we introduce an oracle model in which the oracle provides partial information about the opponent's hand. Interestingly, when players can get partial information of the opponents' hands via oracle, the winning player can find a winning strategy as if it is the (perfect information) TANHINMIN. Furthermore, we show various results about other relationships between the power of oracles and the existence of a computable winning strategy.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: TANHINMIN is a simplified and perfect information variant of DAIHINMIN, which is major playing card game in Japan. It can be decided in linear time which player has a winning strategy in 2-player TANHINMIN. This paper is concerned with how we obtain a winning strategy for the imperfect information variant of TANHINMIN. If any information about the opponent player's hand is not given at all, it is obviously difficult or impossible to find a winning strategy, though such a hard situation does not likely happen in real game plays; players usually receive some little information about the opponent player's hand through a game such as the number of cards. To handle the situation that a player can receive some information about the opponent player's hand, we introduce an oracle model in which the oracle provides partial information about the opponent's hand. Interestingly, when players can get partial information of the opponents' hands via oracle, the winning player can find a winning strategy as if it is the (perfect information) TANHINMIN. Furthermore, we show various results about other relationships between the power of oracles and the existence of a computable winning strategy.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11464803
• 書誌情報: 情報処理学会論文誌数理モデル化と応用（TOM）; 巻 15, 号 1, p. 10-17, 発行日 2022-01-31
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7780
• 出版者 / 言語: ja
• 出版者: 情報処理学会