Firefighting as a strategic game

DOI10.1080/15427951.2015.1110542MaRDI QIDQ5856433zbMATH OpenOpenAlexFDO

Authors Carme Àlvarez, Maria J. Blesa, Hendrik Molter

Publication date 26 March 2021

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15427951.2015.1110542

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Noncooperative games (91A10) Games involving graphs (91A43)

Recommendations

• Firefighting as a game
• More fires and more fighters
• Firefighting on trees
• The firefighter problem: empirical results on random graphs
• Politician’s Firefighting

Cites work

• 3/2 firefighters are not enough
• A comment on pure-strategy Nash equilibria in competitive diffusion games
• A generalization of the firefighter problem on \(\mathbb Z \times \mathbb Z\)
• A lower bound of the surviving rate of a planar graph with girth at least seven
• A note on competitive diffusion through social networks
• Approximability of the firefighter problem. Computing cuts over time
• Average firefighting on infinite grids
• Burning a graph as a model of social contagion
• Fighting constrained fires in graphs
• Fire containment in grids of dimension three and higher
• Fire Containment in Planar Graphs
• Firefighting on square, hexagonal, and triangular grids
• Firefighting on the triangular grid
• Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
• Firefighting on trees: How bad is the greedy algorithm?
• Geometric algorithms and combinatorial optimization
• Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
• scientific article; zbMATH DE number 1802810 (Why is no real title available?)
• scientific article; zbMATH DE number 2061798 (Why is no real title available?)
• scientific article; zbMATH DE number 1506515 (Why is no real title available?)
• Information diffusion on the iterated local transitivity model of online social networks
• More fires and more fighters
• Nash equilibria for competitive information diffusion on trees
• Parameterized complexity of firefighting
• Parameterized Complexity of Firefighting Revisited
• Surviving rates of graphs with bounded treewidth for the firefighter problem
• The 2-surviving rate of planar graphs without 4-cycles
• The competitive diffusion game in classes of graphs
• The firefighter problem for cubic graphs
• The firefighter problem for graphs of maximum degree three
• The firefighter problem with more than one firefighter on trees
• The Firefighter Problem: A Structural Analysis
• The Firefighter problem: a survey of results, directions and questions
• The surviving rate of a graph for the firefighter problem
• The surviving rate of an infected network
• The surviving rate of an outerplanar graph for the firefighter problem
• The surviving rate of planar graphs
• Towards more efficient infection and fire fighting

Cited in

(2)

• More fires and more fighters
• Firefighting as a game

This page was built for publication: Firefighting as a strategic game

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