{"id":82106,"updated":"2025-01-21T19:08:29.264975+00:00","links":{},"created":"2025-01-18T23:36:03.511887+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00082106","sets":["1164:2735:6701:6774"]},"path":["6774"],"owner":"11","recid":"82106","title":["進化型繰り返し囚人のジレンマにおける最適戦略の探究"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-05-10"},"_buckets":{"deposit":"86021ff8-95c1-4376-a13f-f84264acfdd0"},"_deposit":{"id":"82106","pid":{"type":"depid","value":"82106","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"進化型繰り返し囚人のジレンマにおける最適戦略の探究","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"進化型繰り返し囚人のジレンマにおける最適戦略の探究"},{"subitem_title":"A Study on the Optimum Strategy in the Iterated Prisoner's Dilemma with Evolvable Genes","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2012-05-10","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"鳥取大学大学院工学研究科エレクトロニクス専攻"},{"subitem_text_value":"鳥取大学大学院工学研究科エレクトロニクス専攻"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tottori University, Graduate School of Engineering, Department of Information and Electronics","subitem_text_language":"en"},{"subitem_text_value":"Tottori University, Graduate School of Engineering, Department of Information and Electronics","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/82106/files/IPSJ-MPS12088003.pdf"},"date":[{"dateType":"Available","dateValue":"2014-05-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS12088003.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"18a27d8b-d7c7-4a4d-96b6-17a002d78a0b","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2012 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"糸井, 良太"},{"creatorName":"田中, 美栄子"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ryota, Itoi","creatorNameLang":"en"},{"creatorName":"Mieko, Tanaka-Yamawaki","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"戦略の自動進化を取り入れた繰り返し囚人のジレンマモデルにおいて，特に2進表現による1次元遺伝子配列の2倍変異や2分裂変異を点変異と組み合わせることで遺伝子の長大化の効果を考察する事を目的としたLindgrenモデルがある．我々はこのモデルに依拠して長大な遺伝子配列が出現するまでシミュレーションを行うことにより，長期間生存する遺伝子配列の内部構造が，しっぺ返し戦略とパブロフ戦略，およびその亜種などの特定の遺伝子配列を要素として持つことを見出した．これらの戦略は単純なしっぺ返し戦略より強く，多様な戦略との対戦に勝利した結果，長期間生存し続けることのできるロバストな戦略であると言える．このような戦略の出現・生存に対する条件について考察する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In the realm of iterated prisoners' dilemma equipped with evolutional generation of strategies, a model has been proposed by Lindgren that allows elongation of genes by means of doubling and fission of one-dimensional genetic arrays multiplied with point mutation of genes. We conducted numerical simulations of this type of models under various conditions, and found that long-lived strategies with long genetic array have some particular elements such as Tit-For-Tat (TFT), Pavlov (PVL), and Ritaliation-oriented-Tit-For-Tat (R-TFT) in common. Such strategies are stronger than a simple TFT, and robust strategies that survive under many matches with various kinds of strategies. We consider when and how such strategies are generated in the history of simulation.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2012-05-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2012-MPS-88"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}