Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games

DOI10.1080/15427951.2008.10129170zbMath1194.91055OpenAlexW2147218196MaRDI QIDQ3574299

Alexander Skopalik, Heiner Ackermann

Publication date: 9 July 2010

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2008.10129170

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (8)

Congestion Games with Complementarities ⋮ Congestion games with mixed objectives ⋮ On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ On the impact of player capability on congestion games ⋮ Congestion Games with Mixed Objectives ⋮ The complexity of pure equilibria in mix-weighted congestion games on parallel links ⋮ Pure Nash equilibria in player-specific and weighted congestion games ⋮ Computing equilibrium in network utility-sharing and discrete election games

This page was built for publication: Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games