Philosopher Inequalities: Time-windowed Single selection, Matching, and More
唐志皓，4 月 13 日 11:30
There is a rising interest for studying the online benchmark as an alternative of the classical offline benchmark in online stochastic settings. We use the name "Philosopher Inequalities" proposed by Wajc to denote such results, as opposed to "Prophet Inequalities" for competing against the optimal offline benchmark.
In this talk, I will share my recent works on establishing philosopher inequalities under unknown arrival orders, including time-windowed single selection, matching, and will discuss a few interesting open questions.