On the Performance of Mildly Greedy Players in Cut Games

DOI10.1007/978-3-319-08783-2_44zbMath1432.91017OpenAlexW2484152015MaRDI QIDQ2920486

Mauro Paladini, Vittorio Bilò

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)

Related Items (1)

On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games

This page was built for publication: On the Performance of Mildly Greedy Players in Cut Games