Design of Network Topology in an Adversarial Environment

DOI10.1007/978-3-642-17197-0_1zbMath1298.91061OpenAlexW4205311788MaRDI QIDQ3056847

Assane Gueye, Jean Walrand, Venkat Anantharam

Publication date: 23 November 2010

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-17197-0_1

zbMATH Keywords

game theorylinear programmingNash equilibriumconnectivitynetwork topologypolymatroidspanning treesnetwork flow algorithmgraph vulnerabilityblocking pairs of polyhedraminimum cut set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Applications of game theory (91A80) Combinatorial optimization (90C27) Data encryption (aspects in computer science) (68P25)

Related Items (12)

Network Elicitation in Adversarial Environment ⋮ Spectral and structural properties of random interdependent networks ⋮ Spanning tree modulus for secure broadcast games ⋮ Hitting a path: a generalization of weighted connectivity via game theory ⋮ Strategic Network Formation with Attack and Immunization ⋮ Faster algorithms for security games on matroids ⋮ Security games on matroids ⋮ Network strength games: the core and the nucleolus ⋮ Designing networks with resiliency to edge failures using two-stage robust optimization ⋮ Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity ⋮ Game-theoretic Robustness of Many-to-one Networks ⋮ Towards a Metric for Communication Network Vulnerability to Attacks: A Game Theoretic Approach

This page was built for publication: Design of Network Topology in an Adversarial Environment