WEKO3
アイテム
{"_buckets": {"deposit": "59f2ab58-dc84-4ca6-9b74-88d7f4214847"}, "_deposit": {"id": "27078", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "27078"}, "status": "published"}, "_oai": {"id": "oai:tsukuba.repo.nii.ac.jp:00027078", "sets": ["311", "1846"]}, "item_5_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2012-03", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "3", "bibliographicPageEnd": "497", "bibliographicPageStart": "487", "bibliographicVolumeNumber": "52", "bibliographic_titles": [{"bibliographic_title": "Journal of global optimization"}]}]}, "item_5_creator_3": {"attribute_name": "著者別名", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "山本, 芳嗣"}], "nameIdentifiers": [{"nameIdentifier": "93384", "nameIdentifierScheme": "WEKO"}]}]}, "item_5_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "We study cooperative transferable utility games with a communication structure represented by an undirected graph, i.e., a group of players can cooperate only if they are connected on the graph. This type of games is called graph games and the best-known solution for them is the Myerson value, which is characterized by the component efficiency axiom and the fairness axiom. Recently the average tree solution has been proposed on cycle-free graph games, and shown to be characterized by the component efficiency axiom and the component fairness axiom. We propose ϵ -parameterized fairness axiom on cycle-free graph games that incorporates the preceding fairness axioms, and show the existence and the uniqueness of the solution. We then discuss a relationship between the existing and our proposed solutions by a numerical example.", "subitem_description_type": "Abstract"}]}, "item_5_identifier_34": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2241/116875"}]}, "item_5_publisher_27": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Springer"}]}, "item_5_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "10.1007/s10898-011-9761-7", "subitem_relation_type_select": "DOI"}}]}, "item_5_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "© Springer Science+Business Media, LLC. 2011\nThe original publication is available at ww.springerlink.com"}]}, "item_5_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "author"}]}, "item_5_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0925-5001", "subitem_source_identifier_type": "ISSN"}]}, "item_5_source_id_9": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_source_identifier": "AA10831465", "subitem_source_identifier_type": "NCID"}]}, "item_5_subject_20": {"attribute_name": "NIIサブジェクト", "attribute_value_mlt": [{"subitem_subject": "社会科学", "subitem_subject_scheme": "Other"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Ryuo, S."}], "nameIdentifiers": [{"nameIdentifier": "93381", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sato, K."}], "nameIdentifiers": [{"nameIdentifier": "93382", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Yamamoto, Y."}], "nameIdentifiers": [{"nameIdentifier": "93383", "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": "JGO_52-3.pdf", "filesize": [{"value": "125.6 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 125600.0, "url": {"label": "JGO_52-3.pdf", "url": "https://tsukuba.repo.nii.ac.jp/record/27078/files/JGO_52-3.pdf"}, "version_id": "4ffab8bb-b923-4840-8d77-daf059eb568d"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Parameterized fairness axioms on cycle-free graph games", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Parameterized fairness axioms on cycle-free graph games"}]}, "item_type_id": "5", "owner": "1", "path": ["311", "1846"], "permalink_uri": "http://hdl.handle.net/2241/116875", "pubdate": {"attribute_name": "公開日", "attribute_value": "2012-04-23"}, "publish_date": "2012-04-23", "publish_status": "0", "recid": "27078", "relation": {}, "relation_version_is_last": true, "title": ["Parameterized fairness axioms on cycle-free graph games"], "weko_shared_id": null}
Parameterized fairness axioms on cycle-free graph games
http://hdl.handle.net/2241/116875
http://hdl.handle.net/2241/116875f2ca0c91-62b2-48d7-a664-e5b61103e8cc
名前 / ファイル | ライセンス | アクション |
---|---|---|
JGO_52-3.pdf (125.6 kB)
|
|
Item type | Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2012-04-23 | |||||
タイトル | ||||||
タイトル | Parameterized fairness axioms on cycle-free graph games | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
著者 |
Ryuo, S.
× Ryuo, S.× Sato, K.× Yamamoto, Y. |
|||||
著者別名 |
山本, 芳嗣
× 山本, 芳嗣 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | We study cooperative transferable utility games with a communication structure represented by an undirected graph, i.e., a group of players can cooperate only if they are connected on the graph. This type of games is called graph games and the best-known solution for them is the Myerson value, which is characterized by the component efficiency axiom and the fairness axiom. Recently the average tree solution has been proposed on cycle-free graph games, and shown to be characterized by the component efficiency axiom and the component fairness axiom. We propose ϵ -parameterized fairness axiom on cycle-free graph games that incorporates the preceding fairness axioms, and show the existence and the uniqueness of the solution. We then discuss a relationship between the existing and our proposed solutions by a numerical example. | |||||
書誌情報 |
Journal of global optimization 巻 52, 号 3, p. 487-497, 発行日 2012-03 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 0925-5001 | |||||
書誌レコードID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AA10831465 | |||||
DOI | ||||||
識別子タイプ | DOI | |||||
関連識別子 | 10.1007/s10898-011-9761-7 | |||||
権利 | ||||||
権利情報 | © Springer Science+Business Media, LLC. 2011 The original publication is available at ww.springerlink.com |
|||||
著者版フラグ | ||||||
値 | author | |||||
出版者 | ||||||
出版者 | Springer | |||||
URI | ||||||
識別子 | http://hdl.handle.net/2241/116875 | |||||
識別子タイプ | HDL |