Competitive Weighted Matching (2009)
In Transversal Matroids, Nedialko B. Dimitrov, C. Greg Plaxton
1 Introduction Motivated by applications related to auctions, mechanism design, and revenuemanagement, Babaioff et al. recently introduced a generalization of the secretary problem called the online...
Competitive Weighted Matching (2008)
Consider a bipartite graph with a set of left-vertices and a set of right-vertices. All the edges adjacent to the same left-vertex have the same weight. We present an algorithm that, given the set of...