Computation of Nash equilibria of attack and defense games on networks

DOI10.1007/978-3-031-43254-5_1MaRDI QIDQ6546276zbMATH OpenFDO

Authors Stanisław Kaźmierowski, Marcin Dziubiński

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43254-5_1

zbMATH Keywords

games on networksNash equilibriumnetwork interdiction

Mathematics Subject Classification ID

Equilibrium refinements (91A11) Games involving graphs (91A43) Algorithmic game theory and complexity (91A68)

Recommendations

• A network game with attackers and a defender
• Equilibrium computation in discrete network games
• Algorithms and Computation
• The Price of Defense
• A game on a distributed network.

Cites work

• A problem in network interdiction
• A survey of network interdiction models and algorithms
• Maximizing the minimum source-sink path subject to a budget constraint
• Optimal interdiction of a supply network
• Optimal interdiction policy for a flow network
• Two-Person Zero-Sum Games for Network Interdiction

Cited in

(2)

• A generalized approach to solve perfect Bayesian Nash equilibrium for practical network attack and defense
• Attack and interception in networks

This page was built for publication: Computation of Nash equilibria of attack and defense games on networks

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