Let G be a weighted directed bipartite graph, where all weights are non-negative. The two parts of the graph will be called "red" and "black." We now define a game on G, with two players, called Red and Black. Place a pebble on any vertex. The game proceeds in discrete steps. If the pebble is on a red vertex, it is Red's turn, and Red must move the pebble along an edge and pay the weight of that edge. If the pebble is on a black vertex, it is Black's turn, and Black can either declare the game over, or move the pebble along an edge and pay the weight of that edge. Black must eventually declare the game over. When the game is over, let cost_B be the total of payments by Black, and cost_R the total of payments by Red. For any given C >= 0, we say that G is C-competitive if there exists a constant K and a strategy for Red such that, if Red plays that strategy, cost_R <= C cost_B + K, regardless of what Black does. The problem is: given G, find the minimum number C such that G is C-competitive.