网络协调对策的光滑有效算法及其约简
Smoothed Efficient Algorithms and Reductions for Network Coordination Games
摘要:
大多数平衡计算问题的最坏情况下的硬度结果提出了超越最坏情况分析的需要。为此,我们研究了在网络协调博弈中寻找纯纳什均衡的平滑复杂性,在最坏的情况下,这是一个PLS完全问题。这是一个潜在的游戏,其中已知顺序更好响应算法收敛到纯NE,尽管是在指数时间内。首先,我们证明多项式(分别)。准多项式)平滑复杂性时,底层游戏图是一个完整的(分别为。任意)图,每个玩家都有很多策略。我们注意到,完整的图形的情况下,让人想起扰动的所有参数,一个共同的假设,在大多数已知的平滑分析结果。其次,我们定义了一个概念的平滑保持减少搜索问题,并获得减少从$2$ -策略网络协调游戏的本地最大切割,并从$k$ -策略游戏(与任意$k$)本地最大切割两个翻转。前者与[BCC 18]的最新结果一起给出了$2$ -策略情形的另一种$O(n^8)$ -时间平滑算法。这种减少的概念允许从一个问题到另一个问题的平滑有效算法的扩展。对于第一组结果,我们开发了一些技术来限制(对抗性)更好的响应序列对潜力的缓慢改善的概率。我们的方法结合并推广了[ER 14,ABPW 17]的局部最大割方法来处理多策略情况:它需要仔细定义捕获潜在增长的矩阵,对抗序列上更紧密的联合边界,并用足够好的秩边界来平衡它。我们相信,本文中开发的方法和概念可能对解决其他潜在和/或拥塞游戏的平滑复杂性感兴趣。
英文摘要:
Worst-case hardness results for most equilibrium computation problems have raised the need for beyond-worst-case analysis. To this end, we study the smoothed complexity of finding pure Nash equilibria in Network Coordination Games, a PLS-complete problem in the worst case. This is a potential game where the sequential-better-response algorithm is known to converge to a pure NE, albeit in exponential time. First, we prove polynomial (resp. quasi-polynomial) smoothed complexity when the underlying game graph is a complete (resp. arbitrary) graph, and every player has constantly many strategies. We note that the complete graph case is reminiscent of perturbing all parameters, a common assumption in most known smoothed analysis results. Second, we define a notion of smoothness-preserving reduction among search problems, and obtain reductions from $2$-strategy network coordination games to local-max-cut, and from $k$-strategy games (with arbitrary $k$) to local-max-cut up to two flips. The former together with the recent result of [BCC18] gives an alternate $O(n^8)$-time smoothed algorithm for the $2$-strategy case. This notion of reduction allows for the extension of smoothed efficient algorithms from one problem to another. For the first set of results, we develop techniques to bound the probability that an (adversarial) better-response sequence makes slow improvements on the potential. Our approach combines and generalizes the local-max-cut approaches of [ER14,ABPW17] to handle the multi-strategy case: it requires a careful definition of the matrix which captures the increase in potential, a tighter union bound on adversarial sequences, and balancing it with good enough rank bounds. We believe that the approach and notions developed herein could be of interest in addressing the smoothed complexity of other potential and/or congestion games.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。