 We assume that U and (w_{u)_{u \in U} are }  known in advance, and that the patience, adjacent edges and edge probabilities for each \scr{C} online vertex are only revealed when the online vertex arrives.
<fluency>  We assume that U and (w_{u)_{u \in U} are }  known in advance, and that the patience, adjacent edges and edge probabilities for each \scr{C} online vertex are only revealed when the online vertex arrives.
 We assume that U and (w_{u)_{u \in U} are } is known in advance, and that the patience, adjacent edges and edge probabilities for each \scr{C} online vertex are only revealed when the online vertex arrives.