Ali Aouad

London Business School

Sussex Place

Regent's Park

London, London NW1 4SA

United Kingdom

SCHOLARLY PAPERS

15

DOWNLOADS
Rank 11,595

SSRN RANKINGS

Top 11,595

in Total Papers Downloads

7,066

SSRN CITATIONS
Rank 10,105

SSRN RANKINGS

Top 10,105

in Total Papers Citations

107

CROSSREF CITATIONS

38

Scholarly Papers (15)

1.

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 933 (42,294)
Citation 8

Abstract:

Loading...

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

2.

Dynamic Stochastic Matching Under Limited Time

Number of pages: 66 Posted: 27 Dec 2019 Last Revised: 25 Oct 2021
Ali Aouad and Omer Saritac
London Business School and London Business School
Downloads 843 (48,627)
Citation 14

Abstract:

Loading...

Dynamic Matching, Approximation Algorithms, Markov Decision Processes

3.

Online Assortment Optimization for Two-sided Matching Platforms

Number of pages: 67 Posted: 07 Jan 2021 Last Revised: 04 Apr 2022
Ali Aouad and Daniela Saban
London Business School and Stanford Graduate School of Business
Downloads 833 (49,514)
Citation 7

Abstract:

Loading...

assortment optimization, matching markets, online platforms, online algorithms

4.

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 830 (49,683)
Citation 22

Abstract:

Loading...

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

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 518 (91,136)
Citation 22

Abstract:

Loading...

Choice Models, Display Optimization, Approximation Schemes, Revenue Management

6.

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 482 (99,530)
Citation 35

Abstract:

Loading...

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

7.

Designing Layouts for Sequential Experiences: Application to Cultural Institutions

IESE Business School Working Paper
Number of pages: 49 Posted: 19 Jul 2022 Last Revised: 01 Oct 2022
London Business School, Georgia Institute of Technology - Scheller College of Business and IESE Business School - University of Navarra
Downloads 416 (118,345)

Abstract:

Loading...

Consumer paths, Sequential choice, Assignment problems, Museums, Cultural operations

8.

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 384 (129,697)
Citation 1

Abstract:

Loading...

Assortment Optimization, FPTAS, Approximate Dynamic Programming, Case Study

9.

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 383 (130,106)
Citation 9

Abstract:

Loading...

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

10.

Algorithmic Collusion in Assortment Games

Number of pages: 41 Posted: 28 Sep 2021 Last Revised: 31 Dec 2021
Ali Aouad and Arnoud V. den Boer
London Business School and University of Amsterdam - Korteweg-de Vries Institute for Mathematics
Downloads 360 (139,411)
Citation 2

Abstract:

Loading...

algorithmic collusion, dynamic assortment, multi-armed bandits, competition law

11.

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 358 (140,243)
Citation 4

Abstract:

Loading...

assortment planning, dynamic substitution, approximation algorithms, submodularity.

12.

The Pandora's Box Problem with Sequential Inspections

Number of pages: 60 Posted: 13 Mar 2021 Last Revised: 10 Jul 2023
Ali Aouad, Jingwei Ji and Yaron Shaposhnik
London Business School, University of Southern California and University of Rochester - Simon Business School
Downloads 288 (176,738)
Citation 2

Abstract:

Loading...

pandora's box problem, dynamic programming, approximate algorithms

13.

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 201 (250,525)
Citation 2

Abstract:

Loading...

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

14.

Centralized versus Decentralized Pricing Controls for Dynamic Matching Platforms

Number of pages: 78 Posted: 23 May 2023 Last Revised: 02 Jun 2023
Ali Aouad, Omer Saritac and Chiwei Yan
London Business School, London Business School and University of California, Berkeley
Downloads 168 (293,421)

Abstract:

Loading...

Dynamic Matching, Pricing, Decentralization, Welfare Analysis

15.

Spatial Matching under Resource Competition

Number of pages: 93 Posted: 26 Jun 2023 Last Revised: 06 Sep 2023
London Business School, London Business School and MIT Sloan School of Management
Downloads 69 (545,251)

Abstract:

Loading...

Spatial Matching, Duopoly, Price of Anarchy, Nash Equilibrium.