Security games on matroids

DOI10.1007/s10107-016-1011-9zbMath1366.91006OpenAlexW2343627606MaRDI QIDQ507326

Dávid Szeszlér

Publication date: 3 February 2017

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-016-1011-9

zbMATH Keywords

Nash equilibriumsecuritymatroid

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) 2-person games (91A05) Network design and communication in computer systems (68M10) Games involving graphs (91A43) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Positional games (pursuit and evasion, etc.) (91A24)

Related Items

Decomposition of probability marginals for security games in abstract networks ⋮ Spanning tree modulus for secure broadcast games ⋮ Hitting a path: a generalization of weighted connectivity via game theory ⋮ New polyhedral and algorithmic results on greedoids ⋮ Faster algorithms for security games on matroids

Cites Work

• Understanding and using linear programming
• Testing membership in matroid polyhedra
• Connectivity and edge-disjoint spanning trees
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A survey of game-theoretic approaches in wireless sensor networks
• Game theory meets network security and privacy
• Design of Network Topology in an Adversarial Environment
• Network Security
• Security and Game Theory
• Optimal attack and reinforcement of a network
• Game Theory in Wireless and Communication Networks