{"id":240342,"updated":"2025-01-19T08:00:35.594574+00:00","links":{},"created":"2025-01-19T01:44:28.833716+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00240342","sets":["6164:6165:6640:11802"]},"path":["11802"],"owner":"44499","recid":"240342","title":["マルチプレイヤゲームにおけるロールを考慮したプレイヤ組み合わせ最適化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-06-19"},"_buckets":{"deposit":"20b76c2f-7856-470f-9b96-854cc7f3c6a5"},"_deposit":{"id":"240342","pid":{"type":"depid","value":"240342","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"マルチプレイヤゲームにおけるロールを考慮したプレイヤ組み合わせ最適化","author_link":["659175","659174","659173"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"マルチプレイヤゲームにおけるロールを考慮したプレイヤ組み合わせ最適化"},{"subitem_title":"Optimization of Player-Combinations in Multiplayer Games Considering the Role","subitem_title_language":"en"}]},"item_type_id":"18","publish_date":"2024-06-19","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"青山学院大学理工学部情報テクノロジー学科"},{"subitem_text_value":"青山学院大学大学院理工学部研究科理工学専攻"},{"subitem_text_value":"青山学院大学理工学部情報テクノロジー学科"}]},"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/240342/files/IPSJ-DICOMO2024218.pdf","label":"IPSJ-DICOMO2024218.pdf"},"date":[{"dateType":"Available","dateValue":"2026-06-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DICOMO2024218.pdf","filesize":[{"value":"1.8 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":"44"}],"accessrole":"open_date","version_id":"af117e70-510d-4f63-979f-e21bbfeb9ee6","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 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_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":"母集団のプレイヤがグループを構成し，それらグループ同士で対戦，協力する形態のゲームは多く存在する．多数のプレイヤの最適なグループ分けを考えた場合，組み合わせ爆発が起こりうる．特に，インターネットを介したオンラインゲームによくみられるような，プレイヤがランダムに集まり，次々とグループが形成，解散されるような環境では，プレイヤの最適な組み合わせを早く見つける必要がある．本研究では，その問題を組み合わせ最適化問題とみなし，二値変数の二次多項式に定式化した．量子アニーリングを用いた場合，Brute-force Searchで解いた場合と比較して，より速い実行時間で解けることがわかった．また，問題のサイズが大きな場合でも，量子アニーリングを用いることにより，精度の高い解を求めることができた．","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1640","bibliographic_titles":[{"bibliographic_title":"マルチメディア，分散，協調とモバイルシンポジウム2024論文集"}],"bibliographicPageStart":"1635","bibliographicIssueDates":{"bibliographicIssueDate":"2024-06-19","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2024"}]},"relation_version_is_last":true,"weko_creator_id":"44499"}}