ダウンロード数: 236
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
j.orl.2015.04.002.pdf | 73.92 kB | Adobe PDF | 見る/開く |
完全メタデータレコード
DCフィールド | 値 | 言語 |
---|---|---|
dc.contributor.author | Fujishige, Satoru | en |
dc.contributor.author | Goemans, Michel | en |
dc.contributor.author | Harks, Tobias | en |
dc.contributor.author | Peis, Britta | en |
dc.contributor.author | Zenklusen, Rico | en |
dc.contributor.alternative | 藤重, 悟 | ja |
dc.date.accessioned | 2015-05-26T04:43:46Z | - |
dc.date.available | 2015-05-26T04:43:46Z | - |
dc.date.issued | 2015-04-17 | - |
dc.identifier.issn | 0167-6377 | - |
dc.identifier.uri | http://hdl.handle.net/2433/197956 | - |
dc.description | Presented at the Aussois Workshop on Combinatorial Optimization, January 5–9, 2015. | en |
dc.description | relation url = preprint version | en |
dc.description.abstract | Congestion games have extensively been studied till recently. It is shown by Fotakis (2010) that for every congestion game on an extension-parallel network, any best-response sequence reaches a pure Nash equilibrium of the game in n steps, where n is the number of players. We show that the fast convergence of best-response sequences results from M-convexity (of Murota (1996)) of the potential function associated with the game. We also give a characterization of M-convex functions in terms of greedy algorithms. | en |
dc.format.mimetype | application/pdf | - |
dc.language.iso | eng | - |
dc.publisher | Elsevier B.V. | en |
dc.rights | © 2015 Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/. NOTICE: this is the author's version of a work that was accepted for publication in Operations Research Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Congestion games viewed from M-convexity, VOL 43, ISSUE 3, (2015) doi:10.1016/j.orl.2015.04.002. | en |
dc.rights | 許諾条件により本文は2018-04-17に公開. | ja |
dc.rights | この論文は出版社版でありません。引用の際には出版社版をご確認ご利用ください。 | ja |
dc.rights | This is not the published version. Please cite only the published version. | en |
dc.subject | Congestion games | en |
dc.subject | Discrete convexity | en |
dc.subject | Best-response dynamics | en |
dc.subject | M-convex function | en |
dc.subject | Discrete convexity | en |
dc.title | Congestion games viewed from M-convexity | en |
dc.type | journal article | - |
dc.type.niitype | Journal Article | - |
dc.identifier.ncid | AA10628585 | - |
dc.identifier.jtitle | Operations Research Letters | en |
dc.identifier.volume | 43 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 329 | - |
dc.identifier.epage | 333 | - |
dc.relation.doi | 10.1016/j.orl.2015.04.002 | - |
dc.textversion | author | - |
dc.startdate.bitstreamsavailable | 2018-04-17 | - |
dc.relation.url | http://www.kurims.kyoto-u.ac.jp/preprint/file/RIMS1816.pdf | - |
dcterms.accessRights | open access | - |
出現コレクション: | 学術雑誌掲載論文等 |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。