Computing equilibria for congestion games with (im)perfect information

zbMATH Open1318.91010MaRDI QIDQ5501334FDOQ5501334

Authors: Rene Beier, Piotr Krysta, Berthold Vöcking, Artur Czumaj 

Publication date: 3 August 2015

Recommendations

• Computing equilibria for a service provider game with (im)perfect information
• Games with congestion-averse utilities
• Efficient computation of approximate pure Nash equilibria in congestion games
• Theoretical Computer Science
• On the structure and complexity of worst-case equilibria

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Stochastic games, stochastic differential games (91A15)

Cited In (5)

• Graphical congestion games
• Selfish routing with incomplete information
• Pure Nash equilibria in a generalization of congestion games allowing resource failures
• Pure Nash equilibria in a generalization of congestion games allowing resource failures
• Evolutionary equilibrium in Bayesian routing games: specialization and niche formation

This page was built for publication: Computing equilibria for congestion games with (im)perfect information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501334)