12 citations · 23 across the 13 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
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…
cs.GT2011
The guarding game is E-complete
R. Samal, T. Valla
The guarding game is a game in which several cops try to guard a region in a (directed or undirected) graph against Robber. Robber and the cops are placed on the vertices of the gr…