The price of defense

DOI10.1007/S00453-020-00783-7MaRDI QIDQ2663706zbMATH OpenOpenAlexFDO

Authors Marios Mavronicolas, Loizos Michael, Vicky Papadopoulou Lesta, Giuseppe Persiano, Anna Philippou, P. G. Spirakis

Publication date 19 April 2021

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://zenodo.org/record/5620037

zbMATH Keywords

attacks and defensesgame theorygraph theoryNash equilibriasecurity

Mathematics Subject Classification ID

Graph theory (05Cxx) Algorithms in computer science (68Wxx)

Recommendations

• The Price of Defense
• Connected subgraph defense games
• Connected subgraph defense games
• A network game with attackers and a defender
• A game on a distributed network.

Cites work

• A characterization of the graphs in which the transversal number equals the matching number
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• A network game with attackers and a defender
• Defending against multiple different attackers
• Equilibrium points in n -person games
• Game theory, alive
• How many attackers can selfish defenders catch?
• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• scientific article; zbMATH DE number 3154393 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 708983 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• Independence numbers of graphs - an extension of the Koenig-Egervary theorem
• König-Egerváry graphs, 2-bicritical graphs and fractional matchings
• Network games with and without synchroneity
• Non-cooperative games
• Static search games played over graphs and general metric spaces
• Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
• The complexity of computing the permanent
• The complexity of uniform Nash equilibria and related regular subgraph problems
• The nature of computation
• Worst-case equilibria

Cited in

(8)

• How many attackers can selfish defenders catch?
• scientific article; zbMATH DE number 1745558 (Why is no real title available?)
• Security games on matroids
• The Price of Defense
• Connected subgraph defense games
• Connected subgraph defense games
• Faster algorithms for security games on matroids
• A network game with attackers and a defender

This page was built for publication: The price of defense

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2663706)