Security games on matroids
DOI10.1007/S10107-016-1011-9zbMATH Open1366.91006OpenAlexW2343627606MaRDI QIDQ507326FDOQ507326
Authors: 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
Recommendations
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) 2-person games (91A05) Combinatorial aspects of matroids and geometric lattices (05B35) Games involving graphs (91A43) Network design and communication in computer systems (68M10) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Game theory meets network security and privacy
- Game Theory in Wireless and Communication Networks
- Testing membership in matroid polyhedra
- Security and Game Theory
- Understanding and using linear programming
- Network security. A decision and game-theoretic approach.
- Optimal attack and reinforcement of a network
- A survey of game-theoretic approaches in wireless sensor networks
- Connectivity and edge-disjoint spanning trees
- Design of network topology in an adversarial environment
Cited In (7)
- Decomposition of probability marginals for security games in abstract networks
- Infrastructure security games
- Connected surveillance game
- New polyhedral and algorithmic results on greedoids
- Spanning tree modulus for secure broadcast games
- Faster algorithms for security games on matroids
- Hitting a path: a generalization of weighted connectivity via game theory
This page was built for publication: Security games on matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507326)
