Before revision:  For short-run fairness, we focus on the case of a complete bipartite graph and show that the competitive ratio for online algorithms is between 0.863 and 0.942;
After revision:  For short-run fairness, we show for complete bipartite graphs that the competitive ratio for online algorithms is between 0.863 and 0.942;