Affiliation:
1. Department of Data Science, Friedrich-Alexander-Universität Erlangen-Nürnberg, 91058 Erlangen, Germany;
2. Computer and Information Science, University of Pennsylvania, Philadelphia, Pennsylvania 19104
Abstract
We present a deterministic polynomial-time algorithm for computing [Formula: see text]-approximate (pure) Nash equilibria in (proportional sharing) weighted congestion games with polynomial cost functions of degree at most [Formula: see text]. This is an exponential improvement of the approximation factor with respect to the previously best deterministic algorithm. An appealing additional feature of the algorithm is that it only uses best-improvement steps in the actual game, as opposed to the previously best algorithms, that first had to transform the game itself. Our algorithm is an adaptation of the seminal algorithm by Caragiannis at al. [Caragiannis I, Fanelli A, Gravin N, Skopalik A (2011) Efficient computation of approximate pure Nash equilibria in congestion games. Ostrovsky R, ed. Proc. 52nd Annual Symp. Foundations Comput. Sci. (FOCS) (IEEE Computer Society, Los Alamitos, CA), 532–541; Caragiannis I, Fanelli A, Gravin N, Skopalik A (2015) Approximate pure Nash equilibria in weighted congestion games: Existence, efficient computation, and structure. ACM Trans. Econom. Comput. 3(1):2:1–2:32.], but we utilize an approximate potential function directly on the original game instead of an exact one on a modified game. A critical component of our analysis, which is of independent interest, is the derivation of a novel bound of [Formula: see text] for the price of anarchy (PoA) of [Formula: see text]-approximate equilibria in weighted congestion games, where [Formula: see text] is the Lambert-W function. More specifically, we show that this PoA is exactly equal to [Formula: see text], where [Formula: see text] is the unique positive solution of the equation [Formula: see text]. Our upper bound is derived via a smoothness-like argument, and thus holds even for mixed Nash and correlated equilibria, whereas our lower bound is simple enough to apply even to singleton congestion games.
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Subject
Management Science and Operations Research,Computer Science Applications,General Mathematics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献