On the performance of mildly greedy players in cut games

DOI10.1007/978-3-319-08783-2_44MaRDI QIDQ2920486zbMATH OpenOpenAlexFDO

Authors Vittorio Bilò, Mauro Paladini

Publication date 26 September 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08783-2_44

zbMATH Keywords

Nash equilibriumsocial optimumpure Nash equilibriumcongestion gameinitial strategy

Mathematics Subject Classification ID

Games involving graphs (91A43) Potential and congestion games (91A14)

Recommendations

• On the performance of mildly greedy players in cut games
• Convergence and approximation in potential games
• Convergence and Approximation in Potential Games
• On the Performance of Approximate Equilibria in Congestion Games
• On the performance of approximate equilibria in congestion games

Cited in

(2)

• On the robustness of the approximate price of anarchy in generalized congestion games
• On the performance of mildly greedy players in cut games

This page was built for publication: On the performance of mildly greedy players in cut games

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