FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3105180265> ?p ?o ?g. }

• W3105180265 endingPage "346" @default.
• W3105180265 startingPage "345" @default.
• W3105180265 abstract "The assortment problem in revenue management is the problem of deciding which subset of products to offer to consumers in order to maximise revenue. A simple and natural strategy is to select the best assortment out of all those that are constructed by fixing a threshold revenue π and then choosing all products with revenue at least π. This is known as the revenue-ordered assortments strategy. Our first contribution is an analysis of the performance of the revenue-ordered assortments strategy making only minimal assumptions about the underlying discrete choice model: We assume that consumers behave rationally, in the sense that the probability of choosing a specific product x ∈ S when given a choice set S cannot increase if S is enlarged. This rationality assumption, known as regularity, is satisfied by almost all models studied in the revenue management and choice theory literature. This includes in particular all random utility models, as well as other models introduced recently such as the additive perturbed utility model, the hitting fuzzy attention model, and models obtained using a non-additive random utility function. We provide three types of revenue guarantees for revenue-ordered assortments: If there are k distinct revenues r1, r2, ..., rk associated with the products (listed in increasing order), then revenue-ordered assortments approximate the optimum revenue to within a factor of (A) 1/k; (B) 1/(1 + ln(rk/r1)), and (C) 1/(1 + ln υ), where υ is defined with respect to an optimal assortment S* as the ratio between the probability of just buying a product and that of buying a product with highest revenue in S*. These three guarantees are in general incomparable, that is, (A), (B), or (C) can be the largest depending on the instance. We also show that the three bounds (A), (B), and (C) are exactly tight, in the sense that none of the bounds remains true if multiplied by a factor (1+ e) for any e > 0. When applied to the special case of Mixed MNL models, bound (B) improves the recent analysis of revenue-ordered assortments by Rusmevichientong et al.(POMS, 2014), who showed a bound of 1/(e(1 + ln(rk/r1))). Our second contribution is to draw a connection between assortment optimisation and some pricing problems studied in the theoretical computer science literature by showing that these pricing problems can be restated as an assortment problem under a discrete choice model satisfying the above-mentioned rationality assumption. This includes unit demand envy-free pricing problems and the Stackelberg minimum spanning tree problem. Building on that connection, we then observe that a well-studied heuristic in that area called uniform pricing corresponds in fact to the revenue-ordered assortment strategy for the specifically constructed discrete choice models. As a consequence, our revenue guarantees for revenue-ordered assortments apply. Interestingly, the resulting bounds match and unify known results on uniform pricing that were proved separately in the literature for the envy-free pricing problems and the Stackelberg minimum spanning tree problem. This paper is available at https://arxiv.org/abs/1606.01371" @default.
• W3105180265 created "2020-11-23" @default.
• W3105180265 creator A5038947183 @default.
• W3105180265 creator A5047802067 @default.
• W3105180265 date "2017-06-20" @default.
• W3105180265 modified "2023-09-24" @default.
• W3105180265 title "Assortment Optimisation under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments" @default.
• W3105180265 cites W2148648976 @default.
• W3105180265 hasPublicationYear "2017" @default.
• W3105180265 type Work @default.
• W3105180265 sameAs 3105180265 @default.
• W3105180265 citedByCount "2" @default.
• W3105180265 countsByYear W31051802652017 @default.
• W3105180265 countsByYear W31051802652020 @default.
• W3105180265 crossrefType "proceedings-article" @default.
• W3105180265 hasAuthorship W3105180265A5038947183 @default.
• W3105180265 hasAuthorship W3105180265A5047802067 @default.
• W3105180265 hasBestOaLocation W31051802651 @default.
• W3105180265 hasConcept C10138342 @default.
• W3105180265 hasConcept C126255220 @default.
• W3105180265 hasConcept C144237770 @default.
• W3105180265 hasConcept C149782125 @default.
• W3105180265 hasConcept C162324750 @default.
• W3105180265 hasConcept C177264268 @default.
• W3105180265 hasConcept C182306322 @default.
• W3105180265 hasConcept C195487862 @default.
• W3105180265 hasConcept C199360897 @default.
• W3105180265 hasConcept C2524010 @default.
• W3105180265 hasConcept C2781386248 @default.
• W3105180265 hasConcept C33923547 @default.
• W3105180265 hasConcept C41008148 @default.
• W3105180265 hasConcept C90673727 @default.
• W3105180265 hasConcept C91887955 @default.
• W3105180265 hasConceptScore W3105180265C10138342 @default.
• W3105180265 hasConceptScore W3105180265C126255220 @default.
• W3105180265 hasConceptScore W3105180265C144237770 @default.
• W3105180265 hasConceptScore W3105180265C149782125 @default.
• W3105180265 hasConceptScore W3105180265C162324750 @default.
• W3105180265 hasConceptScore W3105180265C177264268 @default.
• W3105180265 hasConceptScore W3105180265C182306322 @default.
• W3105180265 hasConceptScore W3105180265C195487862 @default.
• W3105180265 hasConceptScore W3105180265C199360897 @default.
• W3105180265 hasConceptScore W3105180265C2524010 @default.
• W3105180265 hasConceptScore W3105180265C2781386248 @default.
• W3105180265 hasConceptScore W3105180265C33923547 @default.
• W3105180265 hasConceptScore W3105180265C41008148 @default.
• W3105180265 hasConceptScore W3105180265C90673727 @default.
• W3105180265 hasConceptScore W3105180265C91887955 @default.
• W3105180265 hasLocation W31051802651 @default.
• W3105180265 hasOpenAccess W3105180265 @default.
• W3105180265 hasPrimaryLocation W31051802651 @default.
• W3105180265 hasRelatedWork W1479338616 @default.
• W3105180265 hasRelatedWork W1976965402 @default.
• W3105180265 hasRelatedWork W2082623911 @default.
• W3105180265 hasRelatedWork W2141097009 @default.
• W3105180265 hasRelatedWork W2148648976 @default.
• W3105180265 hasRelatedWork W2163465174 @default.
• W3105180265 hasRelatedWork W2221880531 @default.
• W3105180265 hasRelatedWork W2396093196 @default.
• W3105180265 hasRelatedWork W2805423241 @default.
• W3105180265 hasRelatedWork W2807601023 @default.
• W3105180265 hasRelatedWork W2900709728 @default.
• W3105180265 hasRelatedWork W2964340262 @default.
• W3105180265 hasRelatedWork W3120278842 @default.
• W3105180265 hasRelatedWork W3120790676 @default.
• W3105180265 hasRelatedWork W3125773256 @default.
• W3105180265 hasRelatedWork W3134866455 @default.
• W3105180265 hasRelatedWork W3184792889 @default.
• W3105180265 hasRelatedWork W3186627569 @default.
• W3105180265 hasRelatedWork W3192561150 @default.
• W3105180265 hasRelatedWork W194845224 @default.
• W3105180265 isParatext "false" @default.
• W3105180265 isRetracted "false" @default.
• W3105180265 magId "3105180265" @default.
• W3105180265 workType "article" @default.