The following pages link to (Q5009622):
Displaying 9 items.
- The expected asymptotical ratio for preemptive stochastic online problem (Q391147) (← links)
- Contention resolution, matrix scaling and fair allocation (Q2085755) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- Prophet inequalities vs. approximating optimum online (Q2190412) (← links)
- A simple optimal contention resolution scheme for uniform matroids (Q2699957) (← links)
- Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources (Q5106367) (← links)
- Online Contention Resolution Schemes with Applications to Bayesian Selection Problems (Q5856151) (← links)
- Optimally Handling Commitment Issues in Online Throughput Maximization (Q5874511) (← links)
- Prophet secretary for combinatorial auctions and matroids (Q6640585) (← links)