Asymmetric coloring games on incomparability graphs

Tomasz Krawczyk, Bartosz Walczak

Consider the following game on a graph $G$: Alice and Bob take turns coloring the vertices of $G$ properly from a fixed set of colors; Alice wins when the entire graph has been col…