Ali Aouad

Massachusetts Institute of Technology (MIT) - Sloan School of Management

London Business School

Sussex Place

Regent's Park

London, London NW1 4SA

United Kingdom

  • Massachusetts Institute of Technology (MIT) - Sloan School of Management

  • London Business School

SCHOLARLY PAPERS

15

DOWNLOADS
Rank 9,904

SSRN RANKINGS

Top 9,904

in Total Papers Downloads

9,422

TOTAL CITATIONS
Rank 8,528

SSRN RANKINGS

Top 8,528

in Total Papers Citations

175

Scholarly Papers (15)

Actions:
Email selected abstracts
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
Ali Aouad, Jacob Feldman, Danny Segev and Dennis Zhang
Massachusetts Institute of Technology (MIT) - Sloan School of Management, 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 1,220 (34,612)
Citation 16

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
Massachusetts Institute of Technology (MIT) - Sloan School of Management and Singapore Management University - Lee Kong Chian School of Business
Downloads 1,044 (43,345)
Citation 19

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
Massachusetts Institute of Technology (MIT) - Sloan School of Management and Stanford Graduate School of Business
Downloads 1,035 (43,958)
Citation 15

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
Massachusetts Institute of Technology (MIT) - Sloan School of Management, Massachusetts Institute of Technology (MIT) - Sloan School of Management and MIT Sloan School of Management - Operations Research Center
Downloads 881 (54,876)
Citation 22

Abstract:

Loading...

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

5.

Designing Layouts for Sequential Experiences: Application to Cultural Institutions

IESE Business School Working Paper
Number of pages: 82 Posted: 19 Jul 2022 Last Revised: 06 Feb 2024
Ali Aouad, Abhishek Deshmane and Victor Martinez-de-Albeniz
Massachusetts Institute of Technology (MIT) - Sloan School of Management, Georgia Institute of Technology - Scheller College of Business and IESE Business School - University of Navarra
Downloads 724 (71,368)
Citation 2

Abstract:

Loading...

Customer paths, Sequential choice, Assignment problem, Cultural sector operations

6.

Centralized versus Decentralized Pricing Controls for Dynamic Matching Platforms

Number of pages: 100 Posted: 23 May 2023 Last Revised: 04 Nov 2023
Ali Aouad, Omer Saritac and Chiwei Yan
Massachusetts Institute of Technology (MIT) - Sloan School of Management, Singapore Management University - Lee Kong Chian School of Business and University of California, Berkeley
Downloads 712 (72,909)
Citation 3

Abstract:

Loading...

Dynamic Matching, Pricing, Decentralization, Welfare Analysis

7.

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
Massachusetts Institute of Technology (MIT) - Sloan School of Management and Tel Aviv University - School of Mathematical Sciences
Downloads 588 (92,836)
Citation 27

Abstract:

Loading...

Choice Models, Display Optimization, Approximation Schemes, Revenue Management

8.

The Approximability of Assortment Optimization Under Ranking Preferences

Number of pages: 20 Posted: 03 Jun 2015 Last Revised: 02 Feb 2018
Ali Aouad, Vivek F. Farias, Retsef Levi and Danny Segev
Massachusetts Institute of Technology (MIT) - Sloan School of Management, 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 502 (113,051)
Citation 42

Abstract:

Loading...

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

9.

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
Massachusetts Institute of Technology (MIT) - Sloan School of Management and University of Amsterdam - Korteweg-de Vries Institute for Mathematics
Downloads 477 (120,098)
Citation 2

Abstract:

Loading...

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

10.

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
Massachusetts Institute of Technology (MIT) - Sloan School of Management, Washington University in St. Louis - John M. Olin Business School and Tel Aviv University - School of Mathematical Sciences
Downloads 450 (128,739)
Citation 1

Abstract:

Loading...

Assortment Optimization, FPTAS, Approximate Dynamic Programming, Case Study

11.

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
Massachusetts Institute of Technology (MIT) - Sloan School of Management, University of Southern California and University of Rochester - Simon Business School
Downloads 430 (135,866)
Citation 3

Abstract:

Loading...

pandora's box problem, dynamic programming, approximate algorithms

12.

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
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 413 (142,416)
Citation 14

Abstract:

Loading...

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

13.

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
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 383 (155,074)
Citation 4

Abstract:

Loading...

assortment planning, dynamic substitution, approximation algorithms, submodularity.

14.

Spatial Matching under Multihoming

Number of pages: 101 Posted: 26 Jun 2023 Last Revised: 26 Jan 2024
Alireza Amanihamedani, Ali Aouad and Daniel Freund
London Business School, Massachusetts Institute of Technology (MIT) - Sloan School of Management and MIT Sloan School of Management
Downloads 302 (200,507)

Abstract:

Loading...

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

15.

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
Massachusetts Institute of Technology (MIT) - Sloan School of Management and Tel Aviv University - School of Mathematical Sciences
Downloads 261 (232,825)
Citation 5

Abstract:

Loading...

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