Ali Aouad

Publication Activity (10 Years)

Years Active: 2018-2023
Publications (10 Years): 19

Top Topics

Multinomial Logit

Top Venues

Publications

Ali Aouad, Danny Segev
The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications. Oper. Res. 71 (4) (2023)
Ali Aouad, Daniela Sabán
Online Assortment Optimization for Two-Sided Matching Platforms. Manag. Sci. 69 (4) (2023)
Ali Aouad, Adam N. Elmachtoub, Kris Johnson Ferreira, Ryan McNellis
Market Segmentation Trees. Manuf. Serv. Oper. Manag. 25 (2) (2023)
Ali Aouad, Will Ma
A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals. EC (2023)
Ali Aouad, Ömer Saritaç, Chiwei Yan
Centralized Versus Decentralized Pricing Controls for Dynamic Matching Platforms. EC (2023)
Ali Aouad, Jacob B. Feldman, Danny Segev
The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model? Manag. Sci. 69 (5) (2023)
Ali Aouad, Danny Segev
Technical Note - An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem. Oper. Res. 71 (4) (2023)
Ali Aouad, Antoine Désir
Representing Random Utility Choice Models with Neural Networks. CoRR (2022)
Ali Aouad, Will Ma
A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals. CoRR (2022)
Ali Aouad, Ömer Saritaç
Dynamic Stochastic Matching Under Limited Time. Oper. Res. 70 (4) (2022)
Ali Aouad, Danny Segev
Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences. Manag. Sci. 67 (6) (2021)
Ali Aouad, Vivek F. Farias, Retsef Levi
Assortment Optimization Under Consider-Then-Choose Choice Models. Manag. Sci. 67 (6) (2021)
Ali Aouad, Daniela Sabán
Online Assortment Optimization for Two-sided Matching Platforms. EC (2021)
Ali Aouad, Danny Segev
An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem. CoRR (2020)
Ali Aouad, Ömer Saritaç
Dynamic Stochastic Matching Under Limited Time. EC (2020)
Ali Aouad, Danny Segev
The ordered k-median problem: surrogate models and approximation algorithms. Math. Program. 177 (1-2) (2019)
Ali Aouad, Retsef Levi, Danny Segev
Approximation Algorithms for Dynamic Assortment Optimization Models. Math. Oper. Res. 44 (2) (2019)
Ali Aouad, Vivek F. Farias, Retsef Levi, Danny Segev
The Approximability of Assortment Optimization Under Ranking Preferences. Oper. Res. 66 (6) (2018)
Ali Aouad, Retsef Levi, Danny Segev
Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences. Oper. Res. 66 (5) (2018)