Ali Aouad

London Business School

Sussex Place

Regent's Park

London, London NW1 4SA

United Kingdom

SCHOLARLY PAPERS

11

DOWNLOADS
Rank 16,428

SSRN RANKINGS

Top 16,428

in Total Papers Downloads

3,685

SSRN CITATIONS
Rank 15,604

SSRN RANKINGS

Top 15,604

in Total Papers Citations

29

CROSSREF CITATIONS

43

Scholarly Papers (11)

1.

Assortment Optimization Under Consider-Then-Choose Choice Models

Number of pages: 56 Posted: 23 Jan 2020
Ali Aouad, Vivek F. Farias and Retsef Levi
London Business School, Massachusetts Institute of Technology (MIT) - Sloan School of Management and MIT Sloan School of Management - Operations Research Center
Downloads 723 (42,929)
Citation 22

Abstract:

Loading...

Assortment optimization, dynamic programming, choice models, consider-then-choose

2.

The Click-Based MNL Model: A Novel Framework for Modeling Click Data in Assortment Optimization

Number of pages: 74 Posted: 17 Mar 2019 Last Revised: 01 Feb 2021
London Business School, Washington University in St. Louis - John M. Olin Business School, Tel Aviv University - School of Mathematical Sciences and Washington University in St. Louis - John M. Olin Business School
Downloads 458 (76,776)
Citation 11

Abstract:

Loading...

Choice Models, Retailing Platforms, Assortment Optimization, Approximation Schemes, E-Commerce

3.

Dynamic Stochastic Matching Under Limited Time

Number of pages: 61 Posted: 27 Dec 2019 Last Revised: 01 Feb 2021
Ali Aouad and Omer Saritac
London Business School and London Business School
Downloads 440 (80,491)
Citation 5

Abstract:

Loading...

Dynamic Matching, Approximation Algorithms, Markov Decision Processes

4.

The Approximability of Assortment Optimization Under Ranking Preferences

Number of pages: 20 Posted: 03 Jun 2015 Last Revised: 02 Feb 2018
London Business School, Massachusetts Institute of Technology (MIT) - Sloan School of Management, MIT Sloan School of Management - Operations Research Center and Tel Aviv University - School of Mathematical Sciences
Downloads 425 (83,846)
Citation 21

Abstract:

Loading...

Assortment optimization, choice models, hardness of approximation, independent set, approximation algorithms

5.

Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences

Number of pages: 53 Posted: 02 Jan 2016 Last Revised: 19 Sep 2019
Ali Aouad and Danny Segev
London Business School and Tel Aviv University - School of Mathematical Sciences
Downloads 391 (92,306)
Citation 13

Abstract:

Loading...

Choice Models, Display Optimization, Approximation Schemes, Revenue Management

6.

Approximation Algorithms for Dynamic Assortment Optimization Models

Number of pages: 39 Posted: 08 Aug 2015 Last Revised: 02 Feb 2018
Ali Aouad, Retsef Levi and Danny Segev
London Business School, MIT Sloan School of Management - Operations Research Center and Tel Aviv University - School of Mathematical Sciences
Downloads 328 (112,597)
Citation 5

Abstract:

Loading...

Assortment Planning, Inventory Management, Choice Models, Dynamic Optimization, Approximation Algorithms, Submodularity

7.

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

Number of pages: 58 Posted: 05 Sep 2015 Last Revised: 16 Dec 2017
Ali Aouad, Retsef Levi and Danny Segev
London Business School, MIT Sloan School of Management - Operations Research Center and Tel Aviv University - School of Mathematical Sciences
Downloads 311 (119,219)
Citation 4

Abstract:

Loading...

assortment planning, dynamic substitution, approximation algorithms, submodularity.

8.

Online Assortment Optimization for Two-sided Matching Platforms

Number of pages: 56 Posted: 07 Jan 2021 Last Revised: 10 Mar 2021
Ali Aouad and Daniela Saban
London Business School and Stanford Graduate School of Business
Downloads 288 (129,332)
Citation 3

Abstract:

Loading...

assortment optimization, matching markets, online platforms, online algorithms

9.

The Exponomial Choice Model: Algorithmic Frameworks for Assortment Optimization and Data-Driven Estimation Case Studies

Number of pages: 57 Posted: 21 Jun 2018 Last Revised: 20 May 2019
Ali Aouad, Jacob Feldman and Danny Segev
London Business School, Washington University in St. Louis - John M. Olin Business School and Tel Aviv University - School of Mathematical Sciences
Downloads 219 (169,720)
Citation 1

Abstract:

Loading...

Assortment Optimization, FPTAS, Approximate Dynamic Programming, Case Study

10.

The Stability of MNL-Based Demand under Dynamic Customer Substitution and its Algorithmic Implications

Number of pages: 53 Posted: 31 Dec 2019
Ali Aouad and Danny Segev
London Business School and Tel Aviv University - School of Mathematical Sciences
Downloads 75 (380,356)
Citation 2

Abstract:

Loading...

Dynamic substitution, Multinomial Logit choice model, inventory management, probabilistic couplings

11.

The Pandora's Box Problem with Sequential Inspections

Number of pages: 73 Posted: 13 Mar 2021 Last Revised: 17 Jun 2021
Ali Aouad, Jingwei Ji and Yaron Shaposhnik
London Business School, University of Rochester and University of Rochester - Simon Business School
Downloads 27 (576,417)

Abstract:

Loading...

pandora's box problem, dynamic programming, approximate algorithms