A Game-Theoretic Approach to Routing under Adversarial Conditions

DOI10.1007/978-3-642-15240-5_26MaRDI QIDQ3163897zbMATH OpenOpenAlexFDO

Authors Frank G. Radmacher, Wolfgang Thomas

Publication date 27 October 2010

Published in IFIP Advances in Information and Communication Technology (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Communication networks in operations research (90B18) 2-person games (91A05) Applications of game theory (91A80)

Recommendations

• Towards a game theoretic understanding of ad-hoc routing
• Game-theoretic approach for modeling of selfish and group routing
• scientific article; zbMATH DE number 7042410
• A game-theoretic algorithm for non-linear single-path routing problems
• A communication network routing problem: modeling and optimization using non-cooperative game theory
• On the core of routing games
• The impact of worst-case deviations in non-atomic network routing games
• The impact of worst-case deviations in non-atomic network routing games
• scientific article; zbMATH DE number 2086616

Cited in

(9)

• Weakly-acyclic (internet) routing games
• Performance analysis of a cooperative flow game algorithm in ad hoc networks and a comparison to Dijkstra's algorithm
• Network formation game for interference minimization routing in cognitive radio mesh networks
• Towards a game theoretic understanding of ad-hoc routing
• Adversarial control in a delay tolerant network
• Weakly-Acyclic (Internet) Routing Games
• A game-theoretic algorithm for non-linear single-path routing problems
• Connectivity games over dynamic networks
• On the core of routing games with revenues

This page was built for publication: A Game-Theoretic Approach to Routing under Adversarial Conditions

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