Competition-reachability of a graph

AbstractThe reachability r(D) of a directed graph D is the number of ordered pairs of distinct vertices (x,y) with a directed path from x to y. Consider a game associated with a graph G=(V,E) involving two players (maximizer and minimizer) who alternately select edges and orient them. The maximizer attempts to maximize the reachability, while the minimizer attempts to minimize the reachability, of the resulting digraph. If both players play optimally, then the reachability is fixed. Parameters that assign a value to each graph in this manner are called competitive parameters. We determine the competitive-reachability for special classes of graphs and discuss which graphs achieve the minimum and maximum possible values of competitive-reachability