On the public citation graph

Dynamic Assortment Optimization of Horizontally-Differentiated Products: Improved Approximations and Universal Constructions

https://doi.org/10.2139/ssrn.4624637
0 signed · 37 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-0-387-78902-6_6openalex-extracted
Assortment Planning: Review of Literature and Industry Practice
inferredcites →https://doi.org/10.1007/978-1-4615-5579-7openalex-extracted
Product Variety Management
inferredcites →https://doi.org/10.1007/978-1-4939-9606-3openalex-extracted
Revenue Management and Pricing Analytics
inferredcites →https://doi.org/10.1007/bf01588971openalex-extracted
An analysis of approximations for maximizing submodular set functions—I
inferredcites →https://doi.org/10.1007/s00453-018-0450-5openalex-extracted
Assortment Planning with Nested Preferences: Dynamic Programming with Distributions as States?
inferredcites →https://doi.org/10.1016/0304-4076(90)90126-eopenalex-extracted
On the compatibility of nested logit models with utility maximization
inferredcites →https://doi.org/10.1068/a090285openalex-extracted
On the Formation of Travel Demand Models and Economic Evaluation Measures of User Benefit
inferredcites →https://doi.org/10.1086/296093openalex-extracted
Econometric Models for Probabilistic Choice Among Products
inferredcites →https://doi.org/10.1109/focs.2010.60openalex-extracted
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
inferredcites →https://doi.org/10.1111/j.1937-5956.2003.tb00199.xopenalex-extracted
MANAGING PRODUCT VARIETY: AN INTEGRATIVE REVIEW AND RESEARCH DIRECTIONS
inferredcites →https://doi.org/10.1111/poms.12191openalex-extracted
Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters
inferredcites →https://doi.org/10.1111/poms.12365openalex-extracted
Bounding Optimal Expected Revenues for Assortment Optimization under Mixtures of Multinomial Logits
inferredcites →https://doi.org/10.1137/1.9781611973082.82openalex-extracted
Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding
inferredcites →https://doi.org/10.1145/1147954.1147956openalex-extracted
Dependent rounding and its applications to approximation algorithms
inferredcites →https://doi.org/10.1287/mksc.9.3.189openalex-extracted
The Economics of Product Variety: A Survey
inferredcites →https://doi.org/10.1287/mnsc.1030.0147openalex-extracted
Revenue Management Under a General Discrete Choice Model of Consumer Behavior
inferredcites →https://doi.org/10.1287/mnsc.1060.0580openalex-extracted
Assortment Planning and Inventory Decisions Under a Locational Choice Model
inferredcites →https://doi.org/10.1287/mnsc.1120.1610openalex-extracted
A Nonparametric Approach to Modeling Choice with Limited Data
inferredcites →https://doi.org/10.1287/mnsc.2014.1931openalex-extracted
Constrained Assortment Optimization for the Nested Logit Model
inferredcites →https://doi.org/10.1287/mnsc.2018.3230openalex-extracted
Constrained Assortment Optimization Under the Markov Chain–based Choice Model
inferredcites →https://doi.org/10.1287/moor.2018.0933openalex-extracted
Approximation Algorithms for Dynamic Assortment Optimization Models
inferredcites →https://doi.org/10.1287/opre.1080.0567openalex-extracted
A Column Generation Algorithm for Choice-Based Network Revenue Management
inferredcites →https://doi.org/10.1287/opre.2014.1256openalex-extracted
Assortment Optimization Under Variants of the Nested Logit Model
inferredcites →https://doi.org/10.1287/opre.2015.1450openalex-extracted
Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand
inferredcites →https://doi.org/10.1287/opre.2016.1505openalex-extracted
A Markov Chain Approximation to Choice Modeling
inferredcites →https://doi.org/10.1287/opre.2017.1628openalex-extracted
Revenue Management Under the Markov Chain Choice Model
inferredcites →https://doi.org/10.1287/opre.2017.1692openalex-extracted
Technical Note—An Expectation-Maximization Algorithm to Estimate the Parameters of the Markov Chain Choice Model
inferredcites →https://doi.org/10.1287/opre.2018.1734openalex-extracted
Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences
inferredcites →https://doi.org/10.1287/opre.2018.1754openalex-extracted
The Approximability of Assortment Optimization Under Ranking Preferences
inferredcites →https://doi.org/10.1287/opre.2021.2142openalex-extracted
Technical Note—Capacitated Assortment Optimization: Hardness and Approximation
inferredcites →https://doi.org/10.1287/opre.2022.2336openalex-extracted
Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model
inferredcites →https://doi.org/10.1287/opre.2022.2391openalex-extracted
The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications
inferredcites →https://doi.org/10.2139/ssrn.2641268openalex-extracted
inferredcites →https://doi.org/10.2307/1910997openalex-extracted
Specification Tests for the Multinomial Logit Model
inferredcites →https://doi.org/10.2307/2343282openalex-extracted
Individual Choice Behavior: A Theoretical Analysis.
inferredcites →https://doi.org/10.2307/2346567openalex-extracted
The Analysis of Permutations
inferredcites →https://doi.org/10.5555/2133036.2133118openalex-extracted
Multi-budgeted matchings and matroid intersection via dependent rounding
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.