Strategic monitor placement against malicious flows

DOI10.3233/FAIA200070MaRDI QIDQ4999202zbMATH OpenOpenAlexFDO

Authors Giuseppe De Nittis, Diodato Ferraioli, Nicola Gatti, Domenico Longo, V. Auletta

Publication date 6 July 2021

Full work available at URL https://doi.org/10.3233/FAIA200070

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• Connected subgraph defense games
• Connected subgraph defense games
• A network game with attackers and a defender
• Algorithms and Computation
• An iterative security game for computing robust and adaptive network flows

Cited in

(5)

• Can less be more? A game-theoretic analysis of filtering vs. investment
• Network inspection for detecting strategic attacks
• Toward Robust Monitoring of Malicious Outbreaks
• Election manipulation on social networks: seeding, edge removal, edge addition
• Honeynet games: A game theoretic approach to defending network monitors

This page was built for publication: Strategic monitor placement against malicious flows

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