We consider the Bayesian online selection problem of a matching in bipartite graphs, that is, weighted where edges arrive and edge weights are generated from known distribution. This setting corresponds to intersection two matroids work Kleinberg Weinberg [ 40 ] Feldman et al. 27 ]. study simple class nonadaptive policies we call vertex-additive policies. A policy assigns static prices every ve...