Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings

In spite of its widespread applicability in learning theory, probability, combinatorics, and in various other fields, the Mallows model has only recently been examined from revenue management perspectives. To our knowledge, the only provably-good approaches for assortment optimization under the Mall...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical programming Vol. 208; no. 1-2; pp. 111 - 171
Main Authors: Rieger, Alon, Segev, Danny
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2024
Springer
Subjects:
ISSN:0025-5610, 1436-4646
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first