Vineet Goyal

Columbia University - Department of Industrial Engineering and Operations Research (IEOR)

331 S.W. Mudd Building

500 West 120th Street

New York, NY 10027

United States

SCHOLARLY PAPERS

8

DOWNLOADS
Rank 23,833

SSRN RANKINGS

Top 23,833

in Total Papers Downloads

2,448

SSRN CITATIONS
Rank 13,480

SSRN RANKINGS

Top 13,480

in Total Papers Citations

34

CROSSREF CITATIONS

51

Scholarly Papers (8)

1.

Capacitated Assortment Optimization: Hardness and Approximation

Number of pages: 30 Posted: 29 Dec 2014 Last Revised: 29 May 2020
Antoine Désir, Vineet Goyal and Jiawei Zhang
INSEAD, Columbia University - Department of Industrial Engineering and Operations Research (IEOR) and New York University (NYU) - Department of Information, Operations, and Management Sciences
Downloads 502 (66,715)
Citation 47

Abstract:

Loading...

Assortment Optimization, FPTAS

2.

Sparse Process Flexibility Designs: Is Long Chain Really Optimal?

Number of pages: 28 Posted: 14 Jun 2014 Last Revised: 05 Oct 2017
INSEAD, Columbia University - Department of Industrial Engineering and Operations Research (IEOR), Decision Sciences Area, Fuqua School of Business, Duke University and New York University (NYU) - Department of Information, Operations, and Management Sciences
Downloads 501 (66,881)
Citation 9

Abstract:

Loading...

long chain, process flexibility design, stochastic max-flow, capacity pooling

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 424 (81,872)
Citation 29

Abstract:

Loading...

Assortment optimization, choice models, approximation algorithms, Markov chain

4.

Online Assortment Optimization with Reusable Resources

Number of pages: 21 Posted: 07 Mar 2019 Last Revised: 19 Nov 2020
Massachusetts Institute of Technology (MIT), Columbia University - Department of Industrial Engineering and Operations Research (IEOR), Columbia University - Department of Industrial Engineering and Operations Research (IEOR), Massachusetts Institute of Technology (MIT) - School of Engineering, UC Berkeley and Columbia University
Downloads 381 (93,006)
Citation 6

Abstract:

Loading...

Online Algorithms, Assortment Optimization, Resource Allocation, Competitive Ratio

5.

Shapley Meets Uniform: An Axiomatic Framework for Attribution in Online Advertising

Number of pages: 42 Posted: 10 Jun 2019
Columbia University, Columbia Business School - Decision Risk and Operations, INSEAD, Columbia University - Department of Industrial Engineering and Operations Research (IEOR) and Columbia University - Department of Industrial Engineering and Operations Research (IEOR)
Downloads 327 (110,184)

Abstract:

Loading...

digital economy, online advertising, attribution, Markov chain, Shapley value, causality

6.

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 148 (233,859)
Citation 2

Abstract:

Loading...

7.

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 122 (271,959)
Citation 9

Abstract:

Loading...

assortment planning, dynamic substitution, polynomial time approximation schemes

8.

Assortment Optimization over Dense Universe is Easy

Number of pages: 36 Posted: 11 Aug 2020
Kumar Goutam, Vineet Goyal and Henry Lam
Columbia University - Department of Industrial Engineering and Operations Research (IEOR), Columbia University - Department of Industrial Engineering and Operations Research (IEOR) and Columbia University
Downloads 43 (484,017)

Abstract:

Loading...

Assortment Optimization, Mixed MNL, Dense Universe