ダウンロード数: 236

このアイテムのファイル:
ファイル 記述 サイズフォーマット 
j.orl.2015.04.002.pdf73.92 kBAdobe PDF見る/開く
完全メタデータレコード
DCフィールド言語
dc.contributor.authorFujishige, Satoruen
dc.contributor.authorGoemans, Michelen
dc.contributor.authorHarks, Tobiasen
dc.contributor.authorPeis, Brittaen
dc.contributor.authorZenklusen, Ricoen
dc.contributor.alternative藤重, 悟ja
dc.date.accessioned2015-05-26T04:43:46Z-
dc.date.available2015-05-26T04:43:46Z-
dc.date.issued2015-04-17-
dc.identifier.issn0167-6377-
dc.identifier.urihttp://hdl.handle.net/2433/197956-
dc.descriptionPresented at the Aussois Workshop on Combinatorial Optimization, January 5–9, 2015.en
dc.descriptionrelation url = preprint versionen
dc.description.abstractCongestion 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.mimetypeapplication/pdf-
dc.language.isoeng-
dc.publisherElsevier 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.rightsThis is not the published version. Please cite only the published version.en
dc.subjectCongestion gamesen
dc.subjectDiscrete convexityen
dc.subjectBest-response dynamicsen
dc.subjectM-convex functionen
dc.subjectDiscrete convexityen
dc.titleCongestion games viewed from M-convexityen
dc.typejournal article-
dc.type.niitypeJournal Article-
dc.identifier.ncidAA10628585-
dc.identifier.jtitleOperations Research Lettersen
dc.identifier.volume43-
dc.identifier.issue3-
dc.identifier.spage329-
dc.identifier.epage333-
dc.relation.doi10.1016/j.orl.2015.04.002-
dc.textversionauthor-
dc.startdate.bitstreamsavailable2018-04-17-
dc.relation.urlhttp://www.kurims.kyoto-u.ac.jp/preprint/file/RIMS1816.pdf-
dcterms.accessRightsopen access-
出現コレクション:学術雑誌掲載論文等

アイテムの簡略レコードを表示する

Export to RefWorks


出力フォーマット 


このリポジトリに保管されているアイテムはすべて著作権により保護されています。