Generalized mirror descents with non-convex potential functions in atomic congestion games: Continuous time and discrete time
檔案
本條目沒有附加檔案。
日期
2018-02-01
作者
類型
期刊名稱
INFORMATION PROCESSING LETTERS
卷期與頁次
第 130 卷,頁 36–39
ISSN
0020-0190
語言
英文
摘要
When playing certain specific classes of no-regret algorithms such as multiplicative updates and replicator dynamics in atomic congestion games, some previous convergence analyses were done with the standard Rosenthal potential function in terms of mixed strategy profiles (i.e., probability distributions on atomic flows), which could be non-convex. In several other works, the convergence, when playing the mirror-descent algorithm (a more general family of no-regret algorithms including multiplicative updates, gradient descents, etc.), was guaranteed with a convex potential function in terms of nonatomic flows as an approximation of the Rosenthal one. The convexity of the potential function provides convenience for analysis. One may wonder if the convergence of mirror descents can still be guaranteed directly with the non-convex Rosenthal potential function. In this paper, we answer the question affirmatively for discrete-time generalized mirror descents with the smoothness property (similarly adopted in many previous works for congestion games and markets) and for continuous-time generalized mirror descents with the separability of regularization functions. (C) 2017 Elsevier B.V. All rights reserved.
所屬典藏
期刊論文引用此條目
Chen, P.-A. (2018). Generalized mirror descents with non-convex potential functions in atomic congestion games: Continuous time and discrete time. INFORMATION PROCESSING LETTERS, 130, 36–39. https://doi.org/10.1016/j.ipl.2017.10.003
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/144227