ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "14750b03-f1f0-4848-a504-c9021d4bcb79"}, "_deposit": {"id": "387", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "387"}, "status": "published"}, "_oai": {"id": "oai:repository.nii.ac.jp:00000387", "sets": ["136"]}, "author_link": [], "control_number": "387", "item_5_biblio_info_30": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2003-07-11", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "10", "bibliographicPageStart": "1", "bibliographic_titles": [{"bibliographic_title": "NIIテクニカル・レポート", "bibliographic_titleLang": "ja"}, {"bibliographic_title": "NII Technical Report", "bibliographic_titleLang": "en"}]}]}, "item_5_description_28": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "Power indices of weighted majority games are measures of the effects of parties on the voting in a council. Among the many kinds of power indices, Banzhaf index, Shapley-Shubik index and Deegan-Packel index have been studied well. For computing these power indices, dynamic programming algorithms had been proposed. The time complexities of these algorithms are O(n^2q), O(n^3q), and O(n^4q), respectively. We propose new algorithms for computing power indices, whose time complexities are O(nq), O(n^2q), and O(n^2q), respectively.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_5_identifier_registration": {"attribute_name": "ID登録", "attribute_value_mlt": [{"subitem_identifier_reg_text": "10.20736/0000000387", "subitem_identifier_reg_type": "JaLC"}]}, "item_5_publisher_31": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "国立情報学研究所", "subitem_publisher_language": "ja"}]}, "item_5_source_id_32": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1346-5597", "subitem_source_identifier_type": "ISSN"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "宇野, 毅明", "creatorNameLang": "ja"}, {"creatorName": "Uno, Takeaki", "creatorNameLang": "en"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2015-08-27"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "03-006E.pdf", "filesize": [{"value": "140.7 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 140700.0, "url": {"label": "NII Technical Report (NII-2003-006E):Efficient Computation of Power Indices for Weighted Majority Games", "url": "https://repository.nii.ac.jp/record/387/files/03-006E.pdf"}, "version_id": "91809246-95ab-4c1d-9556-7587ef3091f6"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "テクニカルレポート", "subitem_subject_language": "ja", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Technical Report", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "departmental bulletin paper", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "NII Technical Report (NII-2003-006E):Efficient Computation of Power Indices for Weighted Majority Games", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "NII Technical Report (NII-2003-006E):Efficient Computation of Power Indices for Weighted Majority Games", "subitem_title_language": "en"}]}, "item_type_id": "5", "owner": "1", "path": ["136"], "permalink_uri": "https://doi.org/10.20736/0000000387", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2003-07-11"}, "publish_date": "2003-07-11", "publish_status": "0", "recid": "387", "relation": {}, "relation_version_is_last": true, "title": ["NII Technical Report (NII-2003-006E):Efficient Computation of Power Indices for Weighted Majority Games"], "weko_shared_id": -1}
  1. NIIテクニカル・レポート

NII Technical Report (NII-2003-006E):Efficient Computation of Power Indices for Weighted Majority Games

https://doi.org/10.20736/0000000387
https://doi.org/10.20736/0000000387
a4ce00dd-7aee-403e-8cba-d5998a712d53
名前 / ファイル ライセンス アクション
03-006E.pdf NII Technical Report (NII-2003-006E):Efficient Computation of Power Indices for Weighted Majority Games (140.7 kB)
Item type レポート / Report(1)
公開日 2003-07-11
タイトル
言語 en
タイトル NII Technical Report (NII-2003-006E):Efficient Computation of Power Indices for Weighted Majority Games
言語
言語 eng
キーワード
言語 ja
主題Scheme Other
主題 テクニカルレポート
キーワード
言語 en
主題Scheme Other
主題 Technical Report
資源タイプ
資源 http://purl.org/coar/resource_type/c_6501
タイプ departmental bulletin paper
ID登録
ID登録 10.20736/0000000387
ID登録タイプ JaLC
著者 宇野, 毅明

× 宇野, 毅明

ja 宇野, 毅明

en Uno, Takeaki

Search repository
抄録
内容記述タイプ Abstract
内容記述 Power indices of weighted majority games are measures of the effects of parties on the voting in a council. Among the many kinds of power indices, Banzhaf index, Shapley-Shubik index and Deegan-Packel index have been studied well. For computing these power indices, dynamic programming algorithms had been proposed. The time complexities of these algorithms are O(n^2q), O(n^3q), and O(n^4q), respectively. We propose new algorithms for computing power indices, whose time complexities are O(nq), O(n^2q), and O(n^2q), respectively.
言語 en
書誌情報 ja : NIIテクニカル・レポート
en : NII Technical Report

p. 1-10, 発行日 2003-07-11
出版者
言語 ja
出版者 国立情報学研究所
ISSN
収録物識別子タイプ ISSN
収録物識別子 1346-5597
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 06:18:21.321073
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3