WEKO3
アイテム
{"_buckets": {"deposit": "c02a8a65-9118-4af7-bcdb-698abb13f2bb"}, "_deposit": {"created_by": 188, "id": "27482", "owners": [188], "pid": {"revision_id": 0, "type": "depid", "value": "27482"}, "status": "published"}, "_oai": {"id": "oai:tsukuba.repo.nii.ac.jp:00027482", "sets": []}, "author_link": ["94928", "94929"], "item_11_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2012-06", "bibliographicIssueDateType": "Issued"}}]}, "item_11_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "This paper considers cooperative transferable utility games with graph structure,\ncalled graph games. A graph structure restricts the set of possible coalitions of players, so that\nplayers are able to cooperate only if they are connected in the graph. Recently the average tree\nsolution has been proposed for arbitrary graph games by Herings et al. The average tree solution\nis the average of some specific marginal contribution vectors, and was shown to belong to the core\nif the game exhibits link-convexity. In this paper the main focus is placed on the relationship\nbetween the core and the average tree solution, and the following results were obtained. Firstly,\nit was shown that some marginal contribution vectors do not belong to the core even though the\ngame is link-convex. Secondly, an alternative condition to link-convexity was given. Thirdly, it\nwas proven that for cycle-complete graph games the average tree solution is an element of the\ncore if the game is link-convex.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_11_publisher_27": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "University of Tsukuba. Graduate School of Systems and Information Engineering. Doctoral Program in Social Systems \u0026 Management", "subitem_publisher_language": "en"}]}, "item_11_relation_36": {"attribute_name": "シリーズ", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_language": "en", "subitem_relation_name_text": "Department of Social Systems and Management Discussion Paper Series;no.1293"}]}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "IGARASHI, Ayumi", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "94928", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "YAMAMOTO, Yoshitsugu", "creatorNameLang": "en"}, {"creatorName": "山本, 芳嗣", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "94929", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2013-12-25"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "1293.pdf", "filesize": [{"value": "342.3 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "mimetype": "application/pdf", "size": 342300.0, "url": {"objectType": "fulltext", "url": "https://tsukuba.repo.nii.ac.jp/record/27482/files/1293.pdf"}, "version_id": "6996e287-4f46-499d-b358-341d7d3b1a65"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "technical report", "resourceuri": "http://purl.org/coar/resource_type/c_18gh"}]}, "item_title": "Average Tree Solution and Core for Cooperative Games with Graph Structure", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Average Tree Solution and Core for Cooperative Games with Graph Structure", "subitem_title_language": "en"}]}, "item_type_id": "11", "owner": "188", "path": ["2662"], "permalink_uri": "http://hdl.handle.net/2241/117357", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2012-07-03"}, "publish_date": "2012-07-03", "publish_status": "0", "recid": "27482", "relation": {}, "relation_version_is_last": true, "title": ["Average Tree Solution and Core for Cooperative Games with Graph Structure"], "weko_shared_id": -1}
Average Tree Solution and Core for Cooperative Games with Graph Structure
http://hdl.handle.net/2241/117357
http://hdl.handle.net/2241/117357295e613b-3f1c-4668-ba69-d3d99644b25d
名前 / ファイル | ライセンス | アクション |
---|---|---|
1293.pdf (342.3 kB)
|
|
Item type | Technical Report(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2012-07-03 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | Average Tree Solution and Core for Cooperative Games with Graph Structure | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_18gh | |||||
タイプ | technical report | |||||
アクセス権 | ||||||
アクセス権 | open access | |||||
アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
著者 |
IGARASHI, Ayumi
× IGARASHI, Ayumi× 山本, 芳嗣 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | This paper considers cooperative transferable utility games with graph structure, called graph games. A graph structure restricts the set of possible coalitions of players, so that players are able to cooperate only if they are connected in the graph. Recently the average tree solution has been proposed for arbitrary graph games by Herings et al. The average tree solution is the average of some specific marginal contribution vectors, and was shown to belong to the core if the game exhibits link-convexity. In this paper the main focus is placed on the relationship between the core and the average tree solution, and the following results were obtained. Firstly, it was shown that some marginal contribution vectors do not belong to the core even though the game is link-convex. Secondly, an alternative condition to link-convexity was given. Thirdly, it was proven that for cycle-complete graph games the average tree solution is an element of the core if the game is link-convex. |
|||||
言語 | en | |||||
書誌情報 |
発行日 2012-06 |
|||||
出版者 | ||||||
言語 | en | |||||
出版者 | University of Tsukuba. Graduate School of Systems and Information Engineering. Doctoral Program in Social Systems & Management | |||||
シリーズ | ||||||
言語 | en | |||||
関連名称 | Department of Social Systems and Management Discussion Paper Series;no.1293 |