Ali Aouad

According to our database, Ali Aouad authored at least 16 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Technical Note - An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem.

Ali Aouad, Danny Segev

Oper. Res., July, 2023

The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications.

Ali Aouad, Danny Segev

Oper. Res., July, 2023

The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model?

Ali Aouad, Jacob B. Feldman, Danny Segev

Manag. Sci., May, 2023

Online Assortment Optimization for Two-Sided Matching Platforms.

Ali Aouad, Daniela Sabán

Manag. Sci., April, 2023

Market Segmentation Trees.

Ali Aouad, Adam N. Elmachtoub, Kris Johnson Ferreira, Ryan McNellis

Manuf. Serv. Oper. Manag., March, 2023

Centralized Versus Decentralized Pricing Controls for Dynamic Matching Platforms.

Ali Aouad, Ömer Saritaç, Chiwei Yan

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals.

Ali Aouad, Will Ma

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022

Dynamic Stochastic Matching Under Limited Time.

Ali Aouad, Ömer Saritaç

Oper. Res., 2022

Representing Random Utility Choice Models with Neural Networks.

Ali Aouad, Antoine Désir

CoRR, 2022

2021

Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences.

Ali Aouad, Danny Segev

Manag. Sci., 2021

Assortment Optimization Under Consider-Then-Choose Choice Models.

Ali Aouad, Vivek F. Farias, Retsef Levi

Manag. Sci., 2021

2020

An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem.

Ali Aouad, Danny Segev

CoRR, 2020

2019

The ordered k-median problem: surrogate models and approximation algorithms.

Ali Aouad, Danny Segev

Math. Program., 2019

Approximation Algorithms for Dynamic Assortment Optimization Models.

Ali Aouad, Retsef Levi, Danny Segev

Math. Oper. Res., 2019

2018

Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences.

Ali Aouad, Retsef Levi, Danny Segev

Oper. Res., 2018

The Approximability of Assortment Optimization Under Ranking Preferences.

Ali Aouad, Vivek F. Farias, Retsef Levi, Danny Segev

Oper. Res., 2018