Danny Segev

University of Haifa - Department of Statistics

Haifa 31905

Israel

SCHOLARLY PAPERS

15

DOWNLOADS
Rank 18,048

SSRN RANKINGS

Top 18,048

in Total Papers Downloads

2,897

SSRN CITATIONS
Rank 13,913

SSRN RANKINGS

Top 13,913

in Total Papers Citations

22

CROSSREF CITATIONS

51

Scholarly Papers (15)

1.

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 University of Haifa - Department of Statistics
Downloads 394 (80,786)
Citation 18

Abstract:

Loading...

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

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), University of Haifa - Department of Statistics and Columbia University - Department of Industrial Engineering and Operations Research (IEOR)
Downloads 392 (81,247)
Citation 21

Abstract:

Loading...

Assortment optimization, choice models, approximation algorithms, Markov chain

3.

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 University of Haifa - Department of Statistics
Downloads 322 (101,709)
Citation 7

Abstract:

Loading...

Retail Operations, Promotion Optimization, Integer Programming, 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 University of Haifa - Department of Statistics
Downloads 317 (103,535)
Citation 10

Abstract:

Loading...

Choice Models, Display Optimization, Approximation Schemes, Revenue Management

5.

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 University of Haifa - Department of Statistics
Downloads 305 (107,901)
Citation 4

Abstract:

Loading...

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

6.

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 University of Haifa - Department of Statistics
Downloads 295 (111,859)
Citation 2

Abstract:

Loading...

assortment planning, dynamic substitution, approximation algorithms, submodularity.

7.

Click-Based MNL: Algorithmic Frameworks for Modeling Click Data in Assortment Optimization

Number of pages: 69 Posted: 17 Mar 2019 Last Revised: 03 Dec 2019
London Business School, Washington University in St. Louis - John M. Olin Business School, University of Haifa - Department of Statistics and Washington University in St. Louis - John M. Olin Business School
Downloads 268 (123,764)
Citation 4

Abstract:

Loading...

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

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 University of Haifa - Department of Statistics
Downloads 153 (208,362)
Citation 1

Abstract:

Loading...

Assortment Optimization, FPTAS, Approximate Dynamic Programming, Case Study

9.

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

Operations Research, Forthcoming
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 University of Haifa - Department of Statistics
Downloads 117 (256,923)
Citation 7

Abstract:

Loading...

assortment planning, dynamic substitution, polynomial time approximation schemes

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 University of Haifa - Department of Statistics
Downloads 106 (275,479)
Citation 2

Abstract:

Loading...

11.

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

Number of pages: 24 Posted: 01 Apr 2015
Danny Segev
University of Haifa - Department of Statistics
Downloads 91 (304,475)
Citation 2

Abstract:

Loading...

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

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 University of Haifa - Department of Statistics
Downloads 57 (394,653)

Abstract:

Loading...

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

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 University of Haifa - Department of Statistics
Downloads 34 (484,327)

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
University of Haifa - Department of Statistics and University of Rochester - Simon Business School
Downloads 29 (509,326)

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
University of Haifa - Department of Statistics
Downloads 17 (581,850)

Abstract:

Loading...

Assortment optimization, approximation scheme, dynamic programming