Linear loss function for the network blocking game: an efficient model for measuring network robustness and link criticality
DOI10.1007/978-3-642-34266-0_9zbMATH Open1377.68023OpenAlexW1933752MaRDI QIDQ4909435FDOQ4909435
Authors: Aron Laszka, Dávid Szeszlér, Levente Buttyán 
Publication date: 13 March 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-34266-0_9
Recommendations
- Game-theoretic robustness of many-to-one networks
- Quantifying network topology robustness under budget constraints: general model and computational complexity
- Towards a metric for communication network vulnerability to attacks: a game theoretic approach
- Hitting a path: a generalization of weighted connectivity via game theory
- Design of network topology in an adversarial environment
computational complexitygame theoryCheeger constantnetwork robustnessadversarial gamesblocking games
Graph theory (including graph drawing) in computer science (68R10) Applications of game theory (91A80) Noncooperative games (91A10) Network design and communication in computer systems (68M10)
Cited In (7)
- Game-theoretic robustness of many-to-one networks
- Strategic network formation with attack and immunization
- 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
- Network topology vulnerability/cost trade-off: model, application, and computational complexity
- Loss functions for finite sets
- Network Elicitation in Adversarial Environment
This page was built for publication: Linear loss function for the network blocking game: an efficient model for measuring network robustness and link criticality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909435)
