Max-min greedy matching

Abstract

There has been much recent interest in the online bipartite matching problem of Karp, Vazirani and Vazirani [2], and variations of it, due to its applicability to allocation problems in certain economic settings. A prominent example is online advertising; for more details, see the survey by Metha [3]. The new problems are both theoretically elegant and practically relevant.