scientific article; zbMATH DE number 7378727
From MaRDI portal
Publication:5009622
DOI10.4230/LIPIcs.ESA.2018.57MaRDI QIDQ5009622
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1806.09251
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (7)
Prophet inequalities vs. approximating optimum online ⋮ Towards an optimal contention resolution scheme for matchings ⋮ Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources ⋮ A simple optimal contention resolution scheme for uniform matroids ⋮ Contention resolution, matrix scaling and fair allocation ⋮ Online Contention Resolution Schemes with Applications to Bayesian Selection Problems ⋮ An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The ellipsoid method and its consequences in combinatorial optimization
- The Markovian price of information
- Multi-parameter mechanism design and sequential posted pricing
- Price of Correlations in Stochastic Optimization
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Semiamarts and finite values
- Online Contention Resolution Schemes
- Algorithms and Adaptivity Gaps for Stochastic Probing
- Combinatorial Prophet Inequalities
- A Stochastic Probing Problem with Applications
- Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
- Prophet Secretary
- Beyond matroids: secretary problem and prophet inequality with general constraints
- Matroid prophet inequalities
- Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers
- Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers
This page was built for publication:
