Tight guarantees for multiunit prophet inequalities and online stochastic knapsack
| Year of publication: |
2025
|
|---|---|
| Authors: | Jiang, Jiashuo ; Ma, Will ; Zhang, Jiawei |
| Published in: |
Operations research. - Linthicum, Md. : INFORMS, ISSN 1526-5463, ZDB-ID 2019440-7. - Vol. 73.2025, 3, p. 1703-1721
|
| Subject: | Optimization | approximation algorithms | prophet inequalities | online contention resolution scheme | online knapsack | Theorie | Theory | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming | Online-Handel | Online retailing | Online-Marketing | Internet marketing | Einkommensverteilung | Income distribution | Social Web | Social web |
-
Online stochastic max-weight bipartite matching : beyond prophet inequalities
Papadimitriou, Christos H., (2024)
-
The Bayesian prophet : a low-regret framework for online decision making
Vera, Alberto, (2021)
-
Efficient online linear optimization with approximation algorithms
Garber, Dan, (2021)
- More ...
-
Degeneracy is OK : logarithmic regret for network revenue management with indiscrete distributions
Jiang, Jiashuo, (2025)
-
Jiang, Jiashuo, (2020)
-
Learning to order for inventory systems with lost sales and uncertain supplies
Chen, Boxiao, (2024)
- More ...