Hitting a path: a generalization of weighted connectivity via game theory

DOI10.1007/s10878-018-0366-7zbMath1425.91077OpenAlexW2903017706MaRDI QIDQ2424795

Dávid Szeszlér

Publication date: 25 June 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/93829/1/JOCO2019_szeszler.pdf

zbMATH Keywords

game theoryconnectivitynetwork reliability

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) Reliability, availability, maintenance, inspection in operations research (90B25) Connectivity (05C40)

Cites Work

• Unnamed Item
• Security games on matroids
• Faster algorithms for security games on matroids
• Understanding and using linear programming
• Algorithms and complexity analysis for some flow problems
• 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
• Two-Person Zero-Sum Games for Network Interdiction

This page was built for publication: Hitting a path: a generalization of weighted connectivity via game theory