Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games

DOI10.1007/978-3-319-71924-5_14zbMath1405.91073arXiv1710.01634OpenAlexW2764241487MaRDI QIDQ4614069

Grammateia Kotsialou, Alexander Skopalik, Matthias Feldotto, Martin Gairing

Publication date: 30 January 2019

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.01634

zbMATH Keywords

computationShapley cost-sharingweighted congestion gamesapproximate pure Nash equilibriaapproximate price of anarchy

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (4)

Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses ⋮ On approximate pure Nash equilibria in weighted congestion games with polynomial latencies ⋮ The Price of Stability of Weighted Congestion Games ⋮ The Price of Stability of Weighted Congestion Games

This page was built for publication: Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games