In the network flow, shouldn't the lower bound on flow on edge (x,t) be g_x instead of m_x? The other edges seem fine but if we are sourcing flow equivalent to number of games remaining, then g_x says x wins all its remaining games, not m_x because lots of games have been played in the past that we are not considering when sourcing the flow. I might be wrong. Thanks.
Very clear, thanks a lot!
In the network flow, shouldn't the lower bound on flow on edge (x,t) be g_x instead of m_x? The other edges seem fine but if we are sourcing flow equivalent to number of games remaining, then g_x says x wins all its remaining games, not m_x because lots of games have been played in the past that we are not considering when sourcing the flow. I might be wrong. Thanks.
I agree with you!