Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria

M. Feldotto, M. Gairing, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43.

Download
Restricted 453-WINE14FGS.pdf 324.31 KB
Conference Paper
Abstract
In this paper we study the potential function in congestion games. We consider both games with non-decreasing cost functions as well as games with non-increasing utility functions. We show that the value of the potential function $\Phi(\sf s)$ of any outcome $\sf s$ of a congestion game approximates the optimum potential value $\Phi(\sf s^*)$ by a factor $\Psi_{\mathcal{F}}$ which only depends on the set of cost/utility functions $\mathcal{F}$, and an additive term which is bounded by the sum of the total possible improvements of the players in the outcome $\sf s$. The significance of this result is twofold. On the one hand it provides \emph{Price-of-Anarchy}-like results with respect to the potential function. On the other hand, we show that these approximations can be used to compute $(1+\varepsilon)\cdot\Psi_{\mathcal{F}}$-approximate pure Nash equilibria for congestion games with non-decreasing cost functions. For the special case of polynomial cost functions, this significantly improves the guarantees from Caragiannis et al. [FOCS 2011]. Moreover, our machinery provides the first guarantees for general latency functions.
Publishing Year
Proceedings Title
Proceedings of the 10th International Conference on Web and Internet Economics (WINE)
forms.conference.field.series_title_volume.label
LNCS
Page
30-43
LibreCat-ID
453

Cite this

Feldotto M, Gairing M, Skopalik A. Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In: Proceedings of the 10th International Conference on Web and Internet Economics (WINE). LNCS. ; 2014:30-43. doi:10.1007/978-3-319-13129-0_3
Feldotto, M., Gairing, M., & Skopalik, A. (2014). Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE) (pp. 30–43). https://doi.org/10.1007/978-3-319-13129-0_3
@inproceedings{Feldotto_Gairing_Skopalik_2014, series={LNCS}, title={Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria}, DOI={10.1007/978-3-319-13129-0_3}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Skopalik, Alexander}, year={2014}, pages={30–43}, collection={LNCS} }
Feldotto, Matthias, Martin Gairing, and Alexander Skopalik. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 30–43. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_3.
M. Feldotto, M. Gairing, and A. Skopalik, “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria,” in Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43.
Feldotto, Matthias, et al. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43, doi:10.1007/978-3-319-13129-0_3.
Main File(s)
File Name
453-WINE14FGS.pdf 324.31 KB
Access Level
Restricted Closed Access
Last Uploaded
2018-03-16T11:24:11Z


Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar