---
_id: '455'
abstract:
- lang: eng
text: We study the existence of approximate pure Nash equilibria in weighted congestion
games and develop techniques to obtain approximate potential functions that prove
the existence of alpha-approximate pure Nash equilibria and the convergence of
alpha-improvement steps. Specifically, we show how to obtain upper bounds for
approximation factor alpha for a given class of cost functions. For example for
concave cost functions the factor is at most 3/2, for quadratic cost functions
it is at most 4/3, and for polynomial cost functions of maximal degree d it is
at at most d + 1. For games with two players we obtain tight bounds which are
as small as for example 1.054 in the case of quadratic cost functions.
author:
- first_name: Christoph
full_name: Hansknecht, Christoph
last_name: Hansknecht
- first_name: Max
full_name: Klimm, Max
last_name: Klimm
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Hansknecht C, Klimm M, Skopalik A. Approximate pure Nash equilibria in weighted
congestion games. In: *Proceedings of the 17th. International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX)*. LIPIcs. ; 2014:242-257.
doi:10.4230/LIPIcs.APPROX-RANDOM.2014.242'
apa: Hansknecht, C., Klimm, M., & Skopalik, A. (2014). Approximate pure Nash
equilibria in weighted congestion games. In *Proceedings of the 17th. International
Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)*
(pp. 242–257). https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242
bibtex: '@inproceedings{Hansknecht_Klimm_Skopalik_2014, series={LIPIcs}, title={Approximate
pure Nash equilibria in weighted congestion games}, DOI={10.4230/LIPIcs.APPROX-RANDOM.2014.242},
booktitle={Proceedings of the 17th. International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems (APPROX)}, author={Hansknecht, Christoph
and Klimm, Max and Skopalik, Alexander}, year={2014}, pages={242–257}, collection={LIPIcs}
}'
chicago: Hansknecht, Christoph, Max Klimm, and Alexander Skopalik. “Approximate
Pure Nash Equilibria in Weighted Congestion Games.” In *Proceedings of the 17th.
International Workshop on Approximation Algorithms for Combinatorial Optimization
Problems (APPROX)*, 242–57. LIPIcs, 2014. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242.
ieee: C. Hansknecht, M. Klimm, and A. Skopalik, “Approximate pure Nash equilibria
in weighted congestion games,” in *Proceedings of the 17th. International Workshop
on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)*,
2014, pp. 242–257.
mla: Hansknecht, Christoph, et al. “Approximate Pure Nash Equilibria in Weighted
Congestion Games.” *Proceedings of the 17th. International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX)*, 2014, pp. 242–57,
doi:10.4230/LIPIcs.APPROX-RANDOM.2014.242.
short: 'C. Hansknecht, M. Klimm, A. Skopalik, in: Proceedings of the 17th. International
Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX),
2014, pp. 242–257.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:09Z
ddc:
- '040'
department:
- _id: '541'
- _id: '63'
doi: 10.4230/LIPIcs.APPROX-RANDOM.2014.242
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:23:40Z
date_updated: 2018-03-16T11:23:40Z
file_id: '1341'
file_name: 455-HKS14.pdf
file_size: 512712
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:23:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 242 - 257
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 17th. International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems (APPROX)
series_title: LIPIcs
status: public
title: Approximate pure Nash equilibria in weighted congestion games
type: conference
user_id: '477'
year: '2014'
...