Firefighting as a game

DOI10.1007/978-3-319-13123-8_9MaRDI QIDQ2945277zbMATH OpenOpenAlexFDO

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

Publication date 9 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/28172

zbMATH Keywords

algorithmic game theorycoalitionsfirefighter problemNash equilibriaprice of anarchyspreading models for networks

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 strategic game
• More fires and more fighters
• Firefighting on trees
• Politician’s Firefighting
• The firefighter problem: empirical results on random graphs

Cited in

(3)

• More fires and more fighters
• scientific article; zbMATH DE number 6303056 (Why is no real title available?)
• Firefighting as a strategic game

This page was built for publication: Firefighting as a game

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