##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Nodes arrive over time)
Online bipartite matching means vertices in arrive one at a time, and you must match them immediately without future knowledge. The greedy algorithm (match to any available vertex in ) gives a competitive ratio.
The RANKING algorithm (assign random priorities to , match to highest available) achieves competitive ratio. This is used in ad allocation and online marketplaces.
