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_9zbMath1377.68023OpenAlexW1933752MaRDI QIDQ4909435

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

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

Noncooperative games (91A10) Network design and communication in computer systems (68M10) Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Network Elicitation in Adversarial Environment ⋮ Strategic Network Formation with Attack and Immunization ⋮ 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