Finding Social Optima in Congestion Games with Positive Externalities

DOI10.1007/978-3-642-33090-2_35zbMath1366.91012OpenAlexW1763415362MaRDI QIDQ2912857

Bart de Keijzer, Guido Schäfer

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_35

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (2)

Efficient Equilibria in Polymatrix Coordination Games ⋮ A logarithmic approximation for polymatroid congestion games

This page was built for publication: Finding Social Optima in Congestion Games with Positive Externalities