New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling

• Main Authors: Braverman, Mark, Derakhshan, Mahsa, Pollner, Tristan, Saberi, Amin, Wajc, David
• Format: Journal Article
• Language: English
• Published: 21.07.2024
• Subjects: Computer Science - Data Structures and Algorithms

We study the polynomial-time approximability of the optimal online stochastic bipartite matching algorithm, initiated by Papadimitriou et al. (EC'21). Here, nodes on one side of the graph are given upfront, while at each time $t$, an online node and its edge weights are drawn from a time-depend...