Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
Copyright: © 2020 INFORMS Motivated by the dynamic assortment offerings and item pricings occurring in e-commerce, we study a general problem of allocating finite inventories to heterogeneous customers arriving sequentially. We analyze this problem under the framework of competitive analysis, where...
Main Authors: | Ma, Will, Simchi-Levi, David |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Civil and Environmental Engineering |
Format: | Article |
Language: | English |
Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2023
|
Online Access: | https://hdl.handle.net/1721.1/148643 |
Similar Items
-
Dynamic Pricing (and Assortment) Under a Static Calendar
by: Ma, Will, et al.
Published: (2023) -
Assortative matching and search
by: Shimer, Robert, et al.
Published: (2011) -
Spatial pricing and warehouse assortment in online retailing
by: Wang, Xuchen
Published: (2025) -
Latent indices in assortative matching models
by: Diamond, William, et al.
Published: (2018) -
Approximation Algorithms for Dynamic Assortment Optimization Models
by: Aouad, Ali, et al.
Published: (2021)