2 papers
cs.DS2023
Computing m-Eternal Domination Number of Cactus Graphs in Linear Time
Václav Blažej, Jan Matyáš Křišťan, Tomáš Valla
In m-eternal domination attacker and defender play on a graph. Initially, the defender places guards on vertices. In each round, the attacker chooses a vertex to attack. Then, the…
cs.GT2012
LP-based Covering Games with Low Price of Anarchy
Georgios Piliouras, Tomas Valla, Laszlo A. Vegh
We present a new class of vertex cover and set cover games. The price of anarchy bounds match the best known constant factor approximation guarantees for the centralized optimizati…