Imagen de Portada

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Sun, Shuo, Udwani, Rajan, Shen, Zuo-Jun Max
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Submodular Order Functions and Assortment Optimization
por: Udwani, Rajan
Publicado: (2021)

When Location Shapes Choice: Placement Optimization of Substitutable Products
por: Housni, Omar El, et al.
Publicado: (2023)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
por: Housni, Omar El, et al.
Publicado: (2024)

Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
por: Segev, Danny, et al.
Publicado: (2025)

Fair Assortment Planning
por: Chen, Qinyi, et al.
Publicado: (2022)

Assortment optimization given basket shopping behavior using the Ising model
por: Vasilyev, Andrey, et al.
Publicado: (2025)

Optimality of Non-Adaptive Algorithms in Online Submodular Welfare Maximization with Stochastic Outcomes
por: Udwani, Rajan
Publicado: (2024)

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
por: Zhai, Jianing, et al.
Publicado: (2019)

Adwords with Unknown Budgets and Beyond
por: Udwani, Rajan
Publicado: (2021)

When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching
por: Udwani, Rajan
Publicado: (2023)

Solving Linear Programs with Fast Online Learning Algorithms
por: Gao, Wenzhi, et al.
Publicado: (2021)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
por: Su, Yuexin, et al.
Publicado: (2026)

A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
por: Shen, Owen, et al.
Publicado: (2026)

Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
por: Brubaker, Kyle, et al.
Publicado: (2025)

Generalized Assignment and Knapsack Problems in the Random-Order Model
por: Klimm, Max, et al.
Publicado: (2025)

A Variational-Calculus Approach to Online Algorithm Design and Analysis
por: Xu, Pan
Publicado: (2025)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
por: Chen, Yike, et al.
Publicado: (2024)

A Decomposition Theorem for Dynamic Flows
por: Graf, Lukas, et al.
Publicado: (2024)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
por: Xie, Fangzhou
Publicado: (2025)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
por: Encz, Koppány István, et al.
Publicado: (2025)

Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
por: Besbes, Omar, et al.
Publicado: (2022)

Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
por: Chen, Shengminjie, et al.
Publicado: (2026)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
por: Hunkenschröder, Christoph, et al.
Publicado: (2025)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
por: Blankenburg, Daniel, et al.
Publicado: (2025)

Optimization in Sanger Sequencing
por: Carpente, Luisa, et al.
Publicado: (2024)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
por: Shi, Haoyan, et al.
Publicado: (2024)

Almost Tight Bounds for Online Hypergraph Matching
por: Tröbst, Thorben, et al.
Publicado: (2024)

Extracting Dual Solutions via Primal Optimizers
por: Carmon, Yair, et al.
Publicado: (2024)

Isotropic Noise in Stochastic and Quantum Convex Optimization
por: Marsden, Annie, et al.
Publicado: (2025)

Quasi-Self-Concordant Optimization with Lewis Weights
por: Ene, Alina, et al.
Publicado: (2025)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
por: Adil, Deeksha, et al.
Publicado: (2025)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
por: Chang, Claire, et al.
Publicado: (2026)

Optimized methods for composite optimization: a reduction perspective
por: Bok, Jinho, et al.
Publicado: (2025)

Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
por: Nerem, Robert R., et al.
Publicado: (2024)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
por: Chen, Li, et al.
Publicado: (2025)

Dynamic Pricing for Reusable Resources: The Power of Two Prices
por: Balseiro, Santiago R., et al.
Publicado: (2023)

Dynamic Batching of Online Arrivals to Leverage Economies of Scale
por: Bhimaraju, Akhil, et al.
Publicado: (2023)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
por: Zhang, Qiao, et al.
Publicado: (2024)

Competitive Online Optimization under Inventory Constraints
por: Lin, Qiulin, et al.
Publicado: (2019)

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
por: Moeini, Mahdi, et al.
Publicado: (2024)