Congestion Games with Complementarities

M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.

Download
Restricted 112-FeldottoLederSkopalik2017.pdf 264.09 KB
Conference Paper
Abstract
We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES) which is a well-studied model in economics. We consider congestion games with different aggregation functions. In particular, we study $L_p$ norms and analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally, we give an almost tight characterization based on monotonicity properties to describe the set of aggregation functions that guarantee the existence of pure Nash equilibria.
Publishing Year
Proceedings Title
Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)
Page
222--233
LibreCat-ID

Cite this

Feldotto M, Leder L, Skopalik A. Congestion Games with Complementarities. In: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC). LNCS. ; 2017:222--233. doi:10.1007/978-3-319-57586-5_19
Feldotto, M., Leder, L., & Skopalik, A. (2017). Congestion Games with Complementarities. In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC) (pp. 222--233). https://doi.org/10.1007/978-3-319-57586-5_19
@inproceedings{Feldotto_Leder_Skopalik_2017, series={LNCS}, title={Congestion Games with Complementarities}, DOI={10.1007/978-3-319-57586-5_19}, booktitle={Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2017}, pages={222--233}, collection={LNCS} }
Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Complementarities.” In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 222--233. LNCS, 2017. https://doi.org/10.1007/978-3-319-57586-5_19.
M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,” in Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.
Feldotto, Matthias, et al. “Congestion Games with Complementarities.” Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233, doi:10.1007/978-3-319-57586-5_19.
Main File(s)
File Name
112-FeldottoLederSkopalik2017.pdf 264.09 KB
Access Level
Restricted Closed Access
Last Uploaded
2018-03-21T13:05:37Z


Export

Marked Publications

Open Data LibreCat

Sources

arXiv 1701.07304

Search this title in

Google Scholar