Danny Segev

Tel Aviv University - School of Mathematical Sciences

Tel Aviv 69978

Israel

SCHOLARLY PAPERS

20

DOWNLOADS

6,068

SSRN CITATIONS

140

CROSSREF CITATIONS

54

Scholarly Papers (20)

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 962 (41,917)
Citation 16

Abstract:

Loading...

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

2.

Assortment Optimization under the Multi-Purchase Multinomial Logit Choice Model

Number of pages: 55 Posted: 16 Jun 2021
Washington University in St. Louis - John M. Olin Business School, Tel Aviv University - School of Mathematical Sciences, Cornell University - School of Operations Research and Information Engineering, Catholic University of Portugal (UCP) - Catolica Lisbon School of Business and Economics and Cornell University - School of Operations Research and Information Engineering
Downloads 568 (83,749)
Citation 6

Abstract:

Loading...

Consumer choice, multiple simultaneous purchases, assortment optimization, PTAS

3.

Capacity Constrained Assortment Optimization Under the Markov Chain Based Choice Model

Number of pages: 33 Posted: 04 Jul 2015 Last Revised: 22 Oct 2015
Antoine Désir, Vineet Goyal, Danny Segev and Chun Ye
INSEAD, Columbia University - Department of Industrial Engineering and Operations Research (IEOR), Tel Aviv University - School of Mathematical Sciences and Columbia University - Department of Industrial Engineering and Operations Research (IEOR)
Downloads 562 (84,898)
Citation 31

Abstract:

Loading...

Assortment optimization, choice models, approximation algorithms, Markov chain

4.

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 524 (92,647)
Citation 23

Abstract:

Loading...

Choice Models, Display Optimization, Approximation Schemes, Revenue Management

5.

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 485 (101,801)
Citation 37

Abstract:

Loading...

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

6.

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 391 (130,912)
Citation 1

Abstract:

Loading...

Assortment Optimization, FPTAS, Approximate Dynamic Programming, Case Study

7.

Scheduling Promotion Vehicles to Boost Profits

Robert H. Smith School Research Paper No. RHS 2638396
Number of pages: 44 Posted: 02 Aug 2015 Last Revised: 02 May 2017
University of Michigan, Stephen M. Ross School of Business, Desautels Faculty of Management, McGill University, Oracle Retail Science, Massachusetts Institute of Technology (MIT) - Sloan School of Management and Tel Aviv University - School of Mathematical Sciences
Downloads 390 (131,300)
Citation 18

Abstract:

Loading...

Retail Operations, Promotion Optimization, Integer Programming, Approximation Algorithms

8.

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 385 (133,293)
Citation 10

Abstract:

Loading...

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

9.

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 360 (143,528)
Citation 4

Abstract:

Loading...

assortment planning, dynamic substitution, approximation algorithms, submodularity.

10.

Mallows-Smoothed Distribution Over Rankings Approach for Modeling Choice

Number of pages: 65 Posted: 21 May 2018 Last Revised: 28 Sep 2019
INSEAD, Columbia University - Department of Industrial Engineering and Operations Research (IEOR), New York University (NYU) - Department of Information, Operations, and Management Sciences and Tel Aviv University - School of Mathematical Sciences
Downloads 226 (231,185)
Citation 1

Abstract:

Loading...

11.

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 215 (242,286)
Citation 2

Abstract:

Loading...

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

12.

Improved Approximation Schemes for MNL-Driven Sequential Assortment Optimization

Number of pages: 50 Posted: 23 Aug 2019
Jacob Feldman and Danny Segev
Washington University in St. Louis - John M. Olin Business School and Tel Aviv University - School of Mathematical Sciences
Downloads 196 (263,644)
Citation 1

Abstract:

Loading...

Assortment Optimization, Multinomial-Logit Model, Appointment Scheduling, Approximation Scheme

13.

Dynamic Pricing with Menu Costs: Approximation Schemes and Applications to Grocery Retail

Number of pages: 55 Posted: 06 May 2022 Last Revised: 18 Jan 2023
Jacob Feldman and Danny Segev
Washington University in St. Louis - John M. Olin Business School and Tel Aviv University - School of Mathematical Sciences
Downloads 176 (289,919)

Abstract:

Loading...

dynamic pricing, menu costs, grocery retail, approximation schemes

14.

Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand

Operations Research, Forthcoming, MIT Sloan Research Paper No. 5139-15
Number of pages: 32 Posted: 26 Mar 2015 Last Revised: 14 Aug 2015
Vineet Goyal, Retsef Levi and Danny Segev
Columbia University - Department of Industrial Engineering and Operations Research (IEOR), MIT Sloan School of Management - Operations Research Center and Tel Aviv University - School of Mathematical Sciences
Downloads 150 (331,895)
Citation 17

Abstract:

Loading...

assortment planning, dynamic substitution, polynomial time approximation schemes

15.

A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems

Number of pages: 32 Posted: 29 Nov 2018
Danny Segev and Yaron Shaposhnik
Tel Aviv University - School of Mathematical Sciences and University of Rochester - Simon Business School
Downloads 127 (377,827)
Citation 1

Abstract:

Loading...

sequential testing, approximation algorithms, PTAS, dynamic programming

16.

Approximation Schemes for Capacity-Constrained Assortment Optimization under the Nested Logit Model

Number of pages: 31 Posted: 03 Apr 2020
Danny Segev
Tel Aviv University - School of Mathematical Sciences
Downloads 126 (380,072)
Citation 1

Abstract:

Loading...

Assortment optimization, approximation scheme, dynamic programming

17.

Assortment Planning with Nested Preferences: Dynamic Programming with Distributions as States?

Number of pages: 24 Posted: 01 Apr 2015
Danny Segev
Tel Aviv University - School of Mathematical Sciences
Downloads 114 (409,172)
Citation 5

Abstract:

Loading...

Assortment planning, inventory management, dynamic programming, approximation scheme, rounded distributions

18.

Maximum Load Assortment Optimization: Approximation Algorithms and Adaptivity Gaps

Number of pages: 63 Posted: 21 Sep 2023
Cornell University - School of Operations Research and Information Engineering, Cornell University - School of Operations Research and Information Engineering and Tel Aviv University - School of Mathematical Sciences
Downloads 53 (639,463)

Abstract:

Loading...

Assortment Optimization, Maximum Load, Approximation Schemes, Adaptivity Gap, Balls and Bins, Multinomial Logit model.

19.

Quasi-Polynomial Time Approximation Schemes for Assortment Optimization under Mallows-Based Rankings

Number of pages: 58 Posted: 09 Aug 2022
Alon Rieger and Danny Segev
Tel Aviv University - School of Mathematical Sciences and Tel Aviv University - School of Mathematical Sciences
Downloads 51 (650,533)

Abstract:

Loading...

Mallows model, assortment optimization, dynamic programming, quasi-PTAS

20.

Dynamic Assortment Optimization of Horizontally-Differentiated Products: Improved Approximations and Universal Constructions

Number of pages: 31
Aviya Goldstein Feder and Danny Segev
Tel Aviv University - Department of Statistics and Operations Research and Tel Aviv University - School of Mathematical Sciences
Downloads 7

Abstract:

Loading...

Assortment optimization, dynamic substitution, ranking-based choice model, universal approximation