Game-theoretic robustness of many-to-one networks

DOI10.1007/978-3-642-35582-0_7MaRDI QIDQ2840919zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Design of network topology in an adversarial environment
• Linear loss function for the network blocking game: an efficient model for measuring network robustness and link criticality
• Towards a metric for communication network vulnerability to attacks: a game theoretic approach
• Efficient best response computation for strategic network formation under attack
• A game on a distributed network.

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

Cited in

(10)

• Design of network topology in an adversarial environment
• Towards a metric for communication network vulnerability to attacks: a game theoretic approach
• Quantifying network topology robustness under budget constraints: general model and computational complexity
• New polyhedral and algorithmic results on greedoids
• Linear loss function for the network blocking game: an efficient model for measuring network robustness and link criticality
• Spanning tree modulus for secure broadcast games
• Network topology vulnerability/cost trade-off: model, application, and computational complexity
• Network Elicitation in Adversarial Environment
• Noisy three-player dilemma game: robustness of the quantum advantage
• Rolling horizon games of resilient networks with non-uniform horizons

This page was built for publication: Game-theoretic robustness of many-to-one networks

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