TY - GEN
T1 - Weakly-acyclic (Internet) routing games
AU - Engelberg, Roee
AU - Schapira, Michael
PY - 2011
Y1 - 2011
N2 - Weakly-acyclic games - a superclass of potential games - capture distributed environments where simple, globally-asynchronous interactions between strategic agents are guaranteed to converge to an equilibrium. We explore the class of routing games in [4, 12], which models important aspects of routing on the Internet. We show that, in interesting contexts, such routing games are weakly acyclic and, moreover, that pure Nash equilibria in such games can be found in a computationally efficient manner.
AB - Weakly-acyclic games - a superclass of potential games - capture distributed environments where simple, globally-asynchronous interactions between strategic agents are guaranteed to converge to an equilibrium. We explore the class of routing games in [4, 12], which models important aspects of routing on the Internet. We show that, in interesting contexts, such routing games are weakly acyclic and, moreover, that pure Nash equilibria in such games can be found in a computationally efficient manner.
KW - Weakly-acyclic games
KW - best-response dynamics
KW - convergence to Nash equilibrium
KW - routing games
UR - http://www.scopus.com/inward/record.url?scp=80054023216&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-24829-0_26
DO - 10.1007/978-3-642-24829-0_26
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:80054023216
SN - 9783642248283
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 290
EP - 301
BT - Algorithmic Game Theory - 4th International Symposium, SAGT 2011, Proceedings
T2 - 4th International Symposium on Algorithmic Game Theory, SAGT 2011
Y2 - 17 October 2011 through 19 October 2011
ER -