Weakly-Acyclic (Internet) Routing Games
From MaRDI portal
Publication:3095281
DOI10.1007/978-3-642-24829-0_26zbMATH Open1233.91069OpenAlexW2014400729MaRDI QIDQ3095281FDOQ3095281
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
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
- On the structure of weakly acyclic games
- On the structure of weakly acyclic games
Cited In (10)
- Interdomain Routing and Games
- Coordination Games on Weighted Directed Graphs
- Title not available (Why is that?)
- “Beat-Your-Rival” Routing Games
- Payoff-based dynamics for multiplayer weakly acyclic games
- Weakly-acyclic (internet) routing games
- Setting Cournot Versus Lyapunov Games Stability Conditions and Equilibrium Point Properties
- Computational complexity of traffic hijacking under BGP and S-BGP
- A classification of weakly acyclic games
- On the structure of weakly acyclic games
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)
