Motivated by the growing interest in correlation-robust stochastic optimization, we
investigate stochastic selection problems beyond independence. Specifically, we consider …

Numerous recent papers have studied the tension between thickening and clearing a
market in (uncertain, online) long-time horizon Markovian settings. In particular,(Aouad and …

We study online bipartite edge coloring, with nodes on one side of the graph revealed
sequentially. The trivial greedy algorithm is (2—o (1))-competitive, which is optimal for …

In this paper, we study the weighted stochastic matching problem. Let $ G=(V, E) $ be a
given edge-weighted graph and let its realization $\mathcal {G} $ be a random subgraph of …

Motivated by the growing interest in correlation-robust stochastic optimization, we
investigate stochastic selection problems beyond independence. Specifically, we consider …

We study the stochastic minimum vertex cover problem for general graphs. In this problem,
we are given a graph G=(V, E) and an existence probability p_e for each edge e∈ E. Edges …

We show that the matroid secretary problem is equivalent to correlated contention resolution
in the online random-order model. Specifically, the matroid secretary conjecture is true if and …