Congestion Games with Capacitated Resources

DOI10.1007/978-3-642-33996-7_18zbMath1284.91285OpenAlexW2143301779MaRDI QIDQ4910947

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

Publication date: 13 March 2013

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33996-7_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

Congestion games with capacitated resources

This page was built for publication: Congestion Games with Capacitated Resources