Danny Segev

Tel Aviv University - School of Mathematical Sciences

Tel Aviv 69978

Israel

SCHOLARLY PAPERS

15

DOWNLOADS

3,568

SSRN CITATIONS

50

CROSSREF CITATIONS

56

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 456 (77,360)
Citation 11

Abstract:

Loading...

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

2.

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 434 (81,569)
Citation 31

Abstract:

Loading...

Assortment optimization, choice models, approximation algorithms, Markov chain

3.

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,596)
Citation 21

Abstract:

Loading...

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

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 390 (92,292)
Citation 13

Abstract:

Loading...

Choice Models, Display Optimization, Approximation Schemes, Revenue Management

5.

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 354 (103,168)
Citation 11

Abstract:

Loading...

Retail Operations, Promotion Optimization, Integer Programming, Approximation Algorithms

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 327 (112,644)
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 (118,899)
Citation 4

Abstract:

Loading...

assortment planning, dynamic substitution, approximation algorithms, submodularity.

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 217 (170,785)
Citation 1

Abstract:

Loading...

Assortment Optimization, FPTAS, Approximate Dynamic Programming, Case Study

9.

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 151 (234,888)
Citation 1

Abstract:

Loading...

10.

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 123 (275,765)
Citation 11

Abstract:

Loading...

assortment planning, dynamic substitution, polynomial time approximation schemes

11.

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 122 (280,739)
Citation 1

Abstract:

Loading...

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

12.

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 93 (333,575)
Citation 2

Abstract:

Loading...

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

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 73 (385,096)
Citation 2

Abstract:

Loading...

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

14.

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 49 (467,610)
Citation 1

Abstract:

Loading...

sequential testing, approximation algorithms, PTAS, dynamic programming

15.

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 43 (492,939)
Citation 1

Abstract:

Loading...

Assortment optimization, approximation scheme, dynamic programming