Weakly-Acyclic (Internet) Routing Games

DOI10.1007/978-3-642-24829-0_26MaRDI QIDQ3095281zbMATHOpenAlexFDO

Authors Roee Engelberg, Michael Schapira

Publication date 28 October 2011

Published in Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24829-0_26

zbMATH Keywords

routing gamesbest-response dynamicsconvergence to Nash equilibriumweakly-acyclic games

Mathematics Subject Classification ID

Applications of game theory (91A80) Internet topics (68M11)

Recommendations

• Weakly-acyclic (internet) routing games
• scientific article; zbMATH DE number 7042410
• On the core of routing games
• Efficient graph topologies in network routing games
• Interdomain Routing and Games
• Two-terminal routing games with unknown active players
• A Game-Theoretic Approach to Routing under Adversarial Conditions
• Robust bottleneck routing games

Cited in

(10)

• Payoff-based dynamics for multiplayer weakly acyclic games
• Computational complexity of traffic hijacking under BGP and S-BGP
• A classification of weakly acyclic games
• Interdomain Routing and Games
• A classification of weakly acyclic games
• scientific article; zbMATH DE number 7450024 (Why is no real title available?)
• “Beat-Your-Rival” Routing Games
• Weakly-acyclic (internet) routing games
• Coordination games on weighted directed graphs
• Setting Cournot versus Lyapunov games stability conditions and equilibrium point properties

This page was built for publication: Weakly-Acyclic (Internet) Routing Games

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