The Stackelberg Vertex Cover problem is a bilevel optimization problem with two players on a graph G = ($F \cup P$, E) where each vertex from F has a weight and the first player selects a price for each vertex in P . Afterwards, the second player finds a minimum weight vertex cover X and the first player receives the set price for each vertex from $X \cap P$ . The goal is to maximize the revenue of the first player. This problem was recently shown to be NP-complete for bipartite graphs while being solvable in linear time on paths. We present four new algorithms for solving Stackelberg Vertex Cover on certain kinds of graphs: (1) a pseudo-polynomial algorithm working on general trees when all weights are integer with a runtime linear in the number of vertices and cubic in the maximum weight (2) a generalization of (1) for bipartite graphs with integer weights and a tree decomposition that is FPT in the maximum weight and the treewidth, (3) a strongly polynomial algorithm for rooted trees having the property that the least common ancestor of any two vertices from P is again in P (this case includes paths); and (4) an FPT-algorithm for trees, where the parameter is the maximum number P-vertices $v_i$ that an F-vertex u can reach while using no other P -vertices. These algorithms are based on a lemma that allows us to split instances at a vertex u into multiple sub-instances, which follows from LP duality and integrality of the vertex cover LP on bipartite graphs. The lemma requires that the minimum vertex covers of the sub-instances agree on u (either all include u or all don't). For this we introduce the concept of commitments. We show that the Stackelberg Vertex Cover problem with commitments is weakly NP-complete. An open question is the non-bipartite case as there is an explicit counterexample showing that the split-and-join technique does not work.

翻译：暂无翻译