research
∙
03/15/2023
Online Bipartite Matching in the Probe-Commit Model
We consider the classical online bipartite matching problem in the probe...
share
research
∙
03/10/2023
Any-Order Online Interval Selection
We consider the problem of online interval scheduling on a single machin...
research
∙
02/08/2021
Prophet Inequality Matching Meets Probing with Commitment
Within the context of stochastic probing with commitment, we consider th...
research
∙
08/21/2020
Greedy Approaches to Online Stochastic Matching
Within the context of stochastic probing with commitment, we consider th...
research
∙
04/29/2020
Bipartite Stochastic Matching: Online, Random Order, and I.I.D. Models
Within the context of stochastic probing with commitment, we consider th...
research
∙
07/27/2019
Electronic markets with multiple submodular buyers
We discuss the problem of setting prices in an electronic market that ha...
research
∙
08/14/2018
An Experimental Study of Algorithms for Online Bipartite Matching
We perform an experimental study of algorithms for online bipartite matc...
research
∙
06/16/2018
Advice Complexity of Priority Algorithms
The priority model of "greedy-like" algorithms was introduced by Borodin...
research
∙
05/02/2018
Greedy Bipartite Matching in Random Type Poisson Arrival Model
We introduce a new random input model for bipartite matching which we ca...
research
∙
01/07/2018
