{"updated":"2025-01-19T21:28:48.550903+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00200004","sets":["6164:6165:6210:9955"]},"path":["9955"],"owner":"44499","recid":"200004","title":["不完全情報二人単貧民分析のためのオラクルモデル"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-11-01"},"_buckets":{"deposit":"f265a059-fd79-451f-a3e7-6473e16a0236"},"_deposit":{"id":"200004","pid":{"type":"depid","value":"200004","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"不完全情報二人単貧民分析のためのオラクルモデル","author_link":["485637","485639","485640","485641","485642","485638"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"不完全情報二人単貧民分析のためのオラクルモデル"},{"subitem_title":"Oracle Models for analyzing imperfect information two-player TANHINMIN","subitem_title_language":"en"}]},"item_type_id":"18","publish_date":"2019-11-01","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋大学大学院情報学研究科 数理情報学専攻"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of athematical Informatics, Graduate School of Informatics, Nagoya University","subitem_text_language":"en"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/200004/files/IPSJ-GPWS2019041.pdf","label":"IPSJ-GPWS2019041.pdf"},"date":[{"dateType":"Available","dateValue":"2019-11-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GPWS2019041.pdf","filesize":[{"value":"1.2 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"18"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e8a57412-308b-4347-925a-d96016f0defe","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2019 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"木谷, 裕紀"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"大渡 勝己"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"小野 廣隆"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kiya, Hironori","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ohto, Katsuki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ono, Hirotaka","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"単貧民とは，不完全情報多人数ゲームである大貧民を完全情報ゲームとして簡易化したものである．これまでの研究により，二人単貧民に関しては配られた手札からどちらが必勝プレイヤであるかどうかを線形時間で判定できることがわかっている．本研究では手札非公開で行う不完全情報単貧民において如何に「必勝戦略」を得るかについて考える．手札に関する情報が全くない場合，確定的な意味で「必勝戦略」を得ることは難しい．このため，本研究では相手の手札に関する部分的な情報を提供するオラクルの存在を許したモデルを定義し，そのオラクル存在下で必勝戦略が得られるかどうかについて考察する．相手がどの札を持っているかなどの情報がない状況でも，マッチング数と呼ばれるゲームの構造パラメータを得るオラクルさえあれば完全情報単貧民と同様の必勝戦略をとることができるなど，オラクルの強さと必勝戦略発見可能性に関する様々な結果が得られることを示す．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"TANHINMIN is a simplified and perfect information variant of DAIHINMIN game, which is ma-jor playing card game in Japan. We know that it can be decided in linear time which player has a winning strategy in 2-player TANHINMIN game. This study is concerned with how we obtain a “winning strategy” for imperfect information variant of TANHINMIN game. If any information about the opponent player’s hand is not given at all, it is obviously difficult 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, e.g., 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 infor-mation about the opponent’s hand. Interestingly, if the oracle provides only some structural information about the game with no information about opponent player’s cards themselves, 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.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"265","bibliographic_titles":[{"bibliographic_title":"ゲームプログラミングワークショップ2019論文集"}],"bibliographicPageStart":"258","bibliographicIssueDates":{"bibliographicIssueDate":"2019-11-01","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2019"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:03:43.418594+00:00","id":200004,"links":{}}