Spremljaj
Ali Aouad
Naslov
Navedeno
Navedeno
Leto
Assortment optimization under consider-then-choose choice models
A Aouad, V Farias, R Levi
Management Science 67 (6), 3368-3386, 2021
1412021
The approximability of assortment optimization under ranking preferences
A Aouad, V Farias, R Levi, D Segev
Operations Research 66 (6), 1661-1669, 2018
1262018
Display optimization for vertically differentiated locations under multinomial logit preferences
A Aouad, D Segev
Management Science 67 (6), 3519-3550, 2021
80*2021
Dynamic Stochastic Matching Under Limited Time
A Aouad, Ö Saritaç
Proceedings of the 21st ACM Conference on Economics and Computation, 789-790, 2020
782020
Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences
A Aouad, R Levi, D Segev
Operations Research 66 (5), 1321-1345, 2018
592018
The Click-based MNL model: A framework for modeling click data in assortment optimization
A Aouad, J Feldman, D Segev, D Zhang
Available at SSRN 3340620, 2019
56*2019
Market segmentation trees
A Aouad, AN Elmachtoub, KJ Ferreira, R McNellis
Manufacturing & Service Operations Management 25 (2), 648-667, 2023
512023
Online assortment optimization for two-sided matching platforms
A Aouad, D Saban
Available at SSRN, 2020
472020
Approximation algorithms for dynamic assortment optimization models
A Aouad, R Levi, D Segev
Mathematics of Operations Research, 2018
422018
The exponomial choice model for assortment optimization: An alternative to the MNL model?
A Aouad, J Feldman, D Segev
Management Science 69 (5), 2814-2832, 2023
33*2023
The ordered k-median problem: surrogate models and approximation algorithms
A Aouad, D Segev
Mathematical Programming, 1-29, 2018
332018
A nonparametric framework for online stochastic matching with correlated arrivals
A Aouad, W Ma
arXiv preprint arXiv:2208.02229, 2022
272022
Representing random utility choice models with neural networks
A Aouad, A Désir
arXiv preprint arXiv:2207.12877, 2022
232022
The Pandora's Box Problem with Sequential Inspections
A Aouad, J Ji, Y Shaposhnik
Available at SSRN 3726167, 2020
192020
The stability of MNL-based demand under dynamic customer substitution and its algorithmic implications
A Aouad, D Segev
Operations Research 71 (4), 1216-1249, 2023
182023
Algorithmic collusion in assortment games
A Aouad, AV den Boer
Available at SSRN 3930364, 2021
172021
An approximate dynamic programming approach to the incremental knapsack problem
A Aouad, D Segev
Operations Research 71 (4), 1414-1433, 2023
162023
Designing layouts for sequential experiences: Application to cultural institutions
A Aouad, A Deshmane, V Martinez-de-Albeniz
SSRN, 2022
62022
Centralized versus Decentralized Pricing Controls for Dynamic Matching Platforms
A Aouad, O Saritac, C Yan
Available at SSRN 4453799, 2023
42023
Spatial Matching under Multihoming
A Amanihamedani, A Aouad, D Freund
Available at SSRN 4488342, 2023
3*2023
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20