Maximum Weight Online Matching with Deadlines
arXiv: Data Structures and Algorithms, Volume abs/1808.03526, 2018.
We study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace. Each pair of agents can yield a different match value, and the planneru0027s goal is to maximize the total value over a finite time horizon. First we study the ...More
Full Text (Upload PDF)
PPT (Upload PPT)