Game-theoretic Robustness of Many-to-one Networks

DOI10.1007/978-3-642-35582-0_7zbMath1268.91042OpenAlexW1700465181MaRDI QIDQ2840919

Aron Laszka, Levente Buttyán, Dávid Szeszlér

Publication date: 24 July 2013

Published in: Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/35468/1/GAMENETS_Laszka_Szeszler_Buttyan.pdf

zbMATH Keywords

game theorysensor networksaccess networksnetwork robustnessadversarial gamesdirected graph strengthgraph persistence

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Games involving graphs (91A43) Applications of game theory (91A80)

Related Items (5)

Network Elicitation in Adversarial Environment ⋮ Spanning tree modulus for secure broadcast games ⋮ Noisy three-player dilemma game: robustness of the quantum advantage ⋮ New polyhedral and algorithmic results on greedoids ⋮ Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity

Cites Work

• A survey on game theory applications in wireless networks
• A survey on networking games in telecommunications
• Design of Network Topology in an Adversarial Environment
• Optimal attack and reinforcement of a network

This page was built for publication: Game-theoretic Robustness of Many-to-one Networks