| Assortment optimization under consider-then-choose choice models A Aouad, V Farias, R Levi Management Science 67 (6), 3368-3386, 2021 | 127 | 2021 |
| The approximability of assortment optimization under ranking preferences A Aouad, V Farias, R Levi, D Segev Operations Research 66 (6), 1661-1669, 2018 | 112 | 2018 |
| Display optimization for vertically differentiated locations under multinomial logit preferences A Aouad, D Segev Management Science 67 (6), 3519-3550, 2021 | 66* | 2021 |
| Dynamic Stochastic Matching Under Limited Time A Aouad, Ö Saritaç Proceedings of the 21st ACM Conference on Economics and Computation, 789-790, 2020 | 66 | 2020 |
| Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences A Aouad, R Levi, D Segev Operations Research 66 (5), 1321-1345, 2018 | 54 | 2018 |
| The Click-based MNL model: A novel framework for modeling click data in assortment optimization A Aouad, J Feldman, D Segev, D Zhang Available at SSRN 3340620, 2019 | 51 | 2019 |
| Market segmentation trees A Aouad, AN Elmachtoub, KJ Ferreira, R McNellis Manufacturing & Service Operations Management 25 (2), 648-667, 2023 | 43 | 2023 |
| Online assortment optimization for two-sided matching platforms A Aouad, D Saban Available at SSRN, 2020 | 42 | 2020 |
| Approximation algorithms for dynamic assortment optimization models A Aouad, R Levi, D Segev Mathematics of Operations Research, 2018 | 40 | 2018 |
| The ordered k-median problem: surrogate models and approximation algorithms A Aouad, D Segev Mathematical Programming, 1-29, 2018 | 34 | 2018 |
| 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 | 27* | 2023 |
| A nonparametric framework for online stochastic matching with correlated arrivals A Aouad, W Ma arXiv preprint arXiv:2208.02229, 2022 | 18 | 2022 |
| 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 | 17 | 2023 |
| Representing random utility choice models with neural networks A Aouad, A Désir arXiv preprint arXiv:2207.12877, 2022 | 16 | 2022 |
| An approximate dynamic programming approach to the incremental knapsack problem A Aouad, D Segev Operations Research 71 (4), 1414-1433, 2023 | 13 | 2023 |
| The Pandora's Box Problem with Sequential Inspections A Aouad, J Ji, Y Shaposhnik Available at SSRN 3726167, 2020 | 13 | 2020 |
| Algorithmic collusion in assortment games A Aouad, AV den Boer Available at SSRN 3930364, 2021 | 11 | 2021 |
| Designing layouts for sequential experiences: Application to cultural institutions A Aouad, A Deshmane, V Martinez-de-Albeniz IESE Business School Working Paper, 2022 | 4 | 2022 |
| Centralized versus Decentralized Pricing Controls for Dynamic Matching Platforms A Aouad, O Saritac, C Yan Available at SSRN 4453799, 2023 | 2 | 2023 |
| Choice-Learn: Large-scale choice modeling for operational contexts through the lens of machine learning V Auriau, A Aouad, A Désir, E Malherbe Journal of Open Source Software 9 (101), 6899, 2024 | | 2024 |
Retsef LeviProfessor of Operations Management, MITVerified email at mit.edu
