Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice (Q5031618): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/opre.2020.2085 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3133039191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Dynamic Assortment Optimization Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of Assortment Optimization Under Ranking Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi-PTAS for unsplittable flow on line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact First-Choice Product Line Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Markov Chain Approximation to Choice Modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Algorithm for Choice-Based Network Revenue Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assortment Optimization Under Variants of the Nested Logit Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The repeated insertion model for rankings: missing link between two subset choice models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revenue Management Under the Markov Chain Choice Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3270181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NON-NULL RANKING MODELS. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4865048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixtures of distance-based models for ranking data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assortment planning with nested preferences: dynamic programming with distributions as states? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revenue Management Under a General Discrete Choice Model of Consumer Behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Expectation-Maximization Method to Estimate a Rank-Based Choice Model of Demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relationship between Luce's choice axiom, Thurstone's theory of comparative judgment, and the double exponential distribution / rank
 
Normal rank

Latest revision as of 01:37, 28 July 2024

scientific article; zbMATH DE number 7474553
Language Label Description Also known as
English
Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice
scientific article; zbMATH DE number 7474553

    Statements

    Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 February 2022
    0 references
    0 references
    choice models
    0 references
    revenue management
    0 references
    market analytics
    0 references
    Mallows model
    0 references
    assortment optimization
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references