12 citations · 23 across the 13 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012
The biased odd cycle game
Asaf Ferber, Roman Glebov, Michael Krivelevich +4
In this paper we consider biased Maker-Breaker games played on the edge set of a given graph . We prove that for every and large enough , there exists a constant fo…
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…