Greedy Algorithms For Stationary Dynamic Matching: Part 2

How should a decision-maker form matches in an environment where agents arrive and depart over time?

This video gives an overview of my recent paper with Felipe Simon.

This video describes the novel linear program which both defines our algorithm, and provides a lower bound on that algorithm's performance. It is meant for people who have already watched Part 1.

Видео Greedy Algorithms For Stationary Dynamic Matching: Part 2 канала Nick Arnosti