Combinatorial aspects of matroids and geometric lattices (05B35) Network design and communication in computer systems (68M10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) 2-person games (91A05) Positional games (pursuit and evasion, etc.) (91A24) Games involving graphs (91A43)
Recommendations
Cites work
- A survey of game-theoretic approaches in wireless sensor networks
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Connectivity and edge-disjoint spanning trees
- Design of network topology in an adversarial environment
- Game Theory in Wireless and Communication Networks
- Game theory meets network security and privacy
- Network security. A decision and game-theoretic approach.
- Optimal attack and reinforcement of a network
- Security and Game Theory
- Testing membership in matroid polyhedra
- Understanding and using linear programming
Cited in
(8)- New polyhedral and algorithmic results on greedoids
- Connected surveillance game
- Hitting a path: a generalization of weighted connectivity via game theory
- Infrastructure security games
- Decomposition of probability marginals for security games in abstract networks
- Spanning tree modulus for secure broadcast games
- Faster algorithms for security games on matroids
- Decomposition of probability marginals for security games in max-flow/min-cut systems
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)
