“…It is shown that the naïve greedy algorithm achieves the optimal competitive ratio of 0.5 among deterministic algorithms, and the Ranking algorithm achieves the optimal competitive ratio of 1 − 1/e among random algorithms. Since then, a fruitful line of research has been established based on the one-sided arrival model, including simplifications of the analysis of Ranking [3,9,18], the vertex-weighted version [1,21], the edge-weighted version [4,7,14,15,17,27], the random arrival version [25,28], b-matching [24], and Adwords [5,8,23,29].…”