Congestion Games with Mixed Objectives
arXiv:1607.05143 · doi:10.1007/978-3-319-48749-6_47
Abstract
We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike. We characterize the existence of pure Nash equilibria (PNE) and the convergence of improvement dynamics. For games that do not possess PNE we give bounds on the approximation ratio of approximate pure Nash equilibria.
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-48749-6_47