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_9MaRDI QIDQ4909435zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational complexitygame theoryCheeger constantnetwork robustnessadversarial gamesblocking games

Mathematics Subject Classification ID

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)

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

Cited in

(7)

• Strategic network formation with attack and immunization
• Game-theoretic robustness of many-to-one networks
• Quantifying network topology robustness under budget constraints: general model and computational complexity
• Network Elicitation in Adversarial Environment
• Towards a metric for communication network vulnerability to attacks: a game theoretic approach
• Loss functions for finite sets
• Network topology vulnerability/cost trade-off: model, application, and computational complexity

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)