Show simple item record

dc.contributor.authorÁlvarez Faura, M. del Carme
dc.contributor.authorBlesa Aguilera, Maria Josep
dc.contributor.authorMolter, Hendrik
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.identifier.citationAlvarez, C.; Blesa, M.; Molter, H. Firefighting as a game. "Lecture notes in computer science", 10 Desembre 2014, núm. 8882, p. 108-119.
dc.description.abstractThe Firefighter Problem was proposed in 1995 [16] as a deterministic discrete-time model for the spread (and containment) of a fire. Its applications reach from real fires to the spreading of diseases and the containment of floods. Furthermore, it can be used to model the spread of computer viruses or viral marketing in communication networks. In this work, we study the problem from a game-theoretical perspective. Such a context seems very appropriate when applied to large networks, where entities may act and make decisions based on their own interests, without global coordination. We model the Firefighter Problem as a strategic game where there is one player for each time step who decides where to place the firefighters. We show that the Price of Anarchy is linear in the general case, but at most 2 for trees. We prove that the quality of the equilibria improves when allowing coalitional cooperation among players. In general, we have that the Price of Anarchy is in T(n/k) where k is the coalition size. Furthermore, we show that there are topologies which have a constant Price of Anarchy even when constant sized coalitions are considered.
dc.format.extent12 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.lcshGame theory
dc.subject.otherFirefighter problem
dc.subject.otherSpreading models for networks
dc.subject.otherAlgorithmic game theory
dc.subject.otherNash equilibria
dc.subject.otherPrice of anarchy
dc.titleFirefighting as a game
dc.subject.lemacJocs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.description.peerreviewedPeer Reviewed
dc.rights.accessOpen Access
dc.description.versionPostprint (author’s final draft)
local.citation.authorAlvarez, C.; Blesa, M.; Molter, H.
local.citation.publicationNameLecture notes in computer science

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder