Parameterized approximations for the two-sided assortment optimization

DOI10.1016/J.ORL.2022.04.002OpenAlexW4280558956WikidataQ114143880 ScholiaQ114143880MaRDI QIDQ2157918

Asrar Ahmed, Milind G. Sohoni, Chaithanya Bandi

Publication date: 22 July 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2022.04.002

zbMATH Keywords

assortment optimizationtwo-sidedparametric boundsonline platforms

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
• Assortment Optimization Under Variants of the Nested Logit Model
• Kidney Exchange
• Revenue Management Under a General Discrete Choice Model of Consumer Behavior
• Dynamic Kidney Exchange
• An analysis of approximations for maximizing submodular set functions—I
• A dynamic model of barter exchange
• College Admissions and the Stability of Marriage

This page was built for publication: Parameterized approximations for the two-sided assortment optimization