Algorithms for online matching, assortment, and pricing with tight weight-dependent competitive ratios
Year of publication: |
2020
|
---|---|
Authors: | Ma, Will ; Simchi-Levi, David |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 68.2020, 6, p. 1787-1803
|
Subject: | online algorithms | revenue management | online matching | Adwords | Algorithmus | Algorithm | Revenue-Management | Revenue management | Online-Handel | Online retailing | Matching | Electronic Commerce | E-commerce | Online-Marketing | Internet marketing | Theorie | Theory | Preismanagement | Pricing strategy | Social Web | Social web |
-
The Bayesian prophet : a low-regret framework for online decision making
Vera, Alberto, (2021)
-
Online allocation and pricing : constant regret via Bellman inequalities
Vera, Alberto, (2021)
-
Online stochastic max-weight bipartite matching : beyond prophet inequalities
Papadimitriou, Christos H., (2024)
- More ...
-
The Competitive Ratio of Threshold Policies for Online Unit-density Knapsack Problems
Ma, Will, (2019)
-
Inventory Balancing with Online Learning
Cheung, Wang Chi, (2018)
-
Assortment Planning for Recommendations at Checkout under Inventory Constraints
Chen, Xi, (2019)
- More ...