“Beat-Your-Rival” Routing Games

DOI10.1007/978-3-030-24455-2_9zbMATH Open1437.91102OpenAlexW4252237115MaRDI QIDQ5896078FDOQ5896078

Authors: Gideon Blocq, Ariel Orda 

Publication date: 8 July 2020

Published in: Multilevel Strategic Interaction Game Models for Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-24455-2_9

Recommendations

• ``Beat-your-rival routing games
• Routing games
• On the core of routing games
• scientific article; zbMATH DE number 7042528
• The line planning routing game
• Shortest path games
• Robust bottleneck routing games
• Interdomain Routing and Games
• Weakly-acyclic (internet) routing games
• Weakly-Acyclic (Internet) Routing Games

zbMATH Keywords

strong Nash equilibriumrouting gamesstrong price of anarchystrong price of stability

Mathematics Subject Classification ID

Games involving graphs (91A43)

Cited In (1)

• ``Beat-your-rival routing games

This page was built for publication: “Beat-Your-Rival” Routing Games

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