Greedy Algorithms For Stationary Dynamic Matching: Part 2
Автор: Nick Arnosti
Загружено: 2026-02-27
Просмотров: 1
Описание:
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.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке: