A network game with attackers and a defender

DOI10.1007/s00453-007-9109-3zbMath1141.91346OpenAlexW2158018794MaRDI QIDQ930603

Anna Philippou, Marios Mavronicolas, Paul G. Spirakis, Vicky G. Papadopoulou

Publication date: 1 July 2008

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9109-3

zbMATH Keywords

Nash equilibriaGraph theoryGame theorySecurityAttacks and defenses

Mathematics Subject Classification ID

Games involving graphs (91A43) (n)-person games, (n>2) (91A06) Matching models (91B68)

Related Items

Network Inspection for Detecting Strategic Attacks, The price of defense, How many attackers can selfish defenders catch?, Defending against multiple different attackers, Connected subgraph defense games, Static search games played over graphs and general metric spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clique partitions, graph compression and speeding-up algorithms
• Non-cooperative games
• E ₁₁ and M theory
• A Graph-Theoretic Game and Its Application to the k-Server Problem
• On Representatives of Subsets
• Eavesdropping games
• Fundamentals of Computation Theory
• The Price of Defense
• Equilibrium points in n -person games
• Algorithms and Computation