Selfishness, collusion and power of local search for the ADMs minimization problem

DOI10.1016/J.COMNET.2008.02.009zbMATH Open1154.68324OpenAlexW2071641767MaRDI QIDQ931111FDOQ931111

Shmuel Zaks, Michele Flammini, Gianpiero Monaco, Mordechai Shalom, Luca Moscardelli

Publication date: 25 June 2008

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2008.02.009

Recommendations

• On equilibria for ADM minimization games
• On equilibria for ADM minimization games
• The effect of collusion in congestion games
• On approximate Nash equilibria in network design
• Collusion in atomic splittable routing games

zbMATH Keywords

Nash equilibriaprice of anarchyoptical networksadd-drop multiplexerprice of collusion

Mathematics Subject Classification ID

Noncooperative games (91A10) Network design and communication in computer systems (68M10)

Cited In (2)

• On equilibria for ADM minimization games
• On equilibria for ADM minimization games

This page was built for publication: Selfishness, collusion and power of local search for the ADMs minimization problem

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