Equilibrium computation in atomic splittable singleton congestion games

DOI10.1007/978-3-319-59250-3_36MaRDI QIDQ2401182zbMATH OpenOpenAlexFDO

Authors Tobias Harks, Veerle Timmermans

Publication date 31 August 2017

Full work available at URL https://doi.org/10.1007/978-3-319-59250-3_36

zbMATH Keywords

atomic splittable congestion gamesNash equilibrium computationpolynomial time algorithmsingleton strategies

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Games involving graphs (91A43)

Recommendations

• Equilibrium computation in resource allocation games
• Efficient computation of approximate pure Nash equilibria in congestion games
• Games with congestion-averse utilities
• Computing pure Nash and strong equilibria in bottleneck congestion games
• Computing approximate equilibria in weighted congestion games via best-responses

Cited in

(7)

• Computing solutions of the multiclass network equilibrium problem with affine cost functions
• Equilibrium computation in resource allocation games
• Correction to: ``Equilibrium computation in resource allocation games
• Uniqueness of equilibria in atomic splittable polymatroid congestion games
• scientific article; zbMATH DE number 7378728 (Why is no real title available?)
• Monotonicity of equilibria in nonatomic congestion games
• Complexity and parametric computation of equilibria in atomic splittable congestion games via weighted block Laplacians

This page was built for publication: Equilibrium computation in atomic splittable singleton congestion games

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