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
∙
02/23/2023
Extending Wormald's Differential Equation Method to One-sided Bounds
In this note, we formulate a “one-sided” version of Wormald's differenti...
research
∙
09/15/2022
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
We present new results for online contention resolution schemes for the ...
research
∙
07/29/2022
Sharp Thresholds in Adaptive Random Graph Processes
Suppose that K_n is the complete graph on vertex set [n], and is a dist...
research
∙
05/04/2022
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process
The semi-random graph process is a single player game in which the playe...
research
∙
02/15/2021
The Phase Transition of Discrepancy in Random Hypergraphs
Motivated by the Beck-Fiala conjecture, we study the discrepancy problem...
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
∙
02/18/2020