Congestion games with capacitated resources

DOI10.1007/s00224-014-9541-0zbMath1327.91041MaRDI QIDQ904685

Jérôme Monnot, Nguyen Kim Thang, Laurent Gourvès, Stefano Moretti

Publication date: 13 January 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-014-9541-0

zbMATH Keywords

algorithms; congestion games; potential function; pure Nash equilibrium

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

91A10: Noncooperative games

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

91B32: Resource and cost allocation (including fair division, apportionment, etc.)