Research

My primary current interest is Revenue Management.
More generally, I am interested in Dynamic Optimization and the analysis of complex stochastic systems.

Preprints
30 V. F. Farias and E. Gutin. “ Optimisitc Gittins Indices. ” Submitted.
Preliminary version:
  • V. F. Farias and E. Gutin. “ Optimisitc Gittins Indices. ” Advances in Neural Information Processing Systems (NIPS) 29, 2016.
29 Y. C. Chen, and V. F. Farias. “ On the Efficacy of Static Prices for Revenue Management in the Face of Strategic Customers. ” R & R in Management Science.
Preliminary version:
  • Y. C. Chen, and V. F. Farias. “ On the Efficacy of Static Prices for Revenue Management in the Face of Strategic Customers. ” 17th ACM Conference on Economics and Computation (EC), 2016.
28 V. F. Farias, S. Jagabathula, and D. Shah. “ Building Optimized and Hyperlocal Product Assortments: A Nonparametric Choice Approach. ” R & R in Marketing Science.
    2016 Gary L. Lilien ISMS-MSI Practice Prize, Finalist
    pdf link
    27 A. Aouad, V. F. Farias, and R. Levi. “ Assortment Optimization Under Consider-then-Choose Choice Models ” R & R in Management Science.
      2015 MIT ORC Best Student Paper Award
      26 N. Bhat, V. F. Farias, and C. C. Moallemi. “ Near Optimal A-B testing ” Minor revision in Management Science.
      25 N. Bhat, V. F. Farias, and C. C. Moallemi. “ Non-parametric Approximate Dynamic Programming via the Kernel Method. ” Submitted
      Preliminary version:
      • N. Bhat, V. F. Farias, and C. C. Moallemi. “ Non-parametric Approximate Dynamic Programming via the Kernel Method. ” Advances in Neural Information Processing Systems (NIPS) 25, 2012.
      Publications
      24 A. Aouad, V. F. Farias, R. Levi, and D. Segev,. “ The Approximability of Assortment Planning Under Ranking Preferences ” Operations Research (forthcoming).
      23 V. F. Farias and A. A. Li. “ Learning Preferences with Side Information. ” Management Science (forthcoming).
      Preliminary version:
      • V. F. Farias and A. A. Li. “ Optimal Recovery of Tensor Slices. ” Artificial Intelligence and Statistics (AISTAT), 2017.
      2017 MIT ORC Best Student Paper Award
      2017 George Nicholson Stident Paper Competition, first place
      22 Y. C. Chen, and V. F. Farias. “ Robust Dynamic Pricing With Strategic Customers. ” Mathematics of Operations Research (forthcoming).
      • Y. C. Chen, and V. F. Farias. “ Robust Dynamic Pricing With Strategic Customers. ” 16th ACM Conference on Economics and Computation (EC), 2015.
      21 C. W. Chan, V. F. Farias, and G. J. Escobar. “ The Impact of Delays on Service Times in the Intensive Care Unit.” Management Science (forthcoming). pdf link
      20 P. Cho, V. F. Farias, J. Kessler, R. Levi, T. Magnanti, E. Zarybnisky. “ Maintenance and flight scheduling of low observable aircraft.” Naval Research Logistics (NRL), 62, No. 1 (2015): 60-80. pdf link
      18 Y. Chen, V. F. Farias. “ Simple Policies for Dynamic Pricing with Imperfect Forecasts ” Operations Research, 61, no. 3 (2013): 612-624. pdf link
      18 V. F. Farias, S. Jagabathula, and D. Shah. “ A Non-Parametric Approach to Modeling Choice with Limited Data. ” Management Science, 59, no. 2 (2013): 305-322.
      Preliminary version:
      • V. F. Farias, S. Jagabathula, and D. Shah. “ A Data-Driven Approach to Modeling Choice. &rdquo Advances in Neural Information Processing Systems 22, 2009.
      2010 INFORMS MSOM Student Paper Competition, first place
      2015 INFORMS Revenue Management and Pricing Section Prize
      2016 INFORMS MSOM Best Paper in Management Science
      pdf link
      17 D. Bertsimas, V. F. Farias, and N. Trichakis. “ Fairness, Efficiency and Flexibility in Organ Allocation for Kidney Transplantation. ” Operations Research, 61, No. 1 (2013): 73-87.
        2011 INFORMS Pierskalla Award, finalist.
        pdf link
        16 D. F. Ciocan, V. F. Farias. “ Dynamic Allocation Problems with Volatile Demand ” Mathematics of Operations Research, 37, No. 3 (2012): 501-525.
          2013 INFORMS MSOM Student Paper Competition, Honoroable Mention.
          pdf link
          15 V. V. Desai, V. F. Farias, and C. C. Moallemi. “ Bounds for Markov decision processes. ” Chapter in Reinforcement Learning and Approximate Dynamic Programming for Feedback Control, (F. L. Lewis, D. Liu, eds.), IEEE Press (2012): 452–473. pdf link
          14 V. V. Desai, V. F. Farias, and C. C. Moallemi. “ Pathwise Optimization for Optimal Stopping Problems. ” Management Science, 58, No. 12 (2012): 2292-2308.
            Best Simulation Publication Award, INFORMS Simulation Society, 2014
            pdf link
            13 D. Bertsimas, V. F. Farias, and N. Trichakis. “ On the Efficiency-Fairness Tradeoff. ” Management Science, 58, No. 12 (2012): 2234-2250. pdf link
            12 C. W. Chan, V. F. Farias, N. Bambos, and G. J. Escobar. “ Optimizing ICU Discharge Decisions with Patient Readmissions.” Operations Research, 60, no. 6 (2012): 1323-1341. pdf link
            11 V. V. Desai, V. F. Farias, and C. C. Moallemi. “ Aproximate Dynamic Programming via a Smoothed Linear Program. ” Operations Research, 60, No. 3 (2012): 655-674.
            Preliminary version:
            • V. V. Desai, V. F. Farias, and C. C. Moallemi. “ A Smoothed Approximate Linear Program. ” Advances in Neural Information Processing Systems 22,2009.
            2011 INFORMS JFIG Paper Competition, first place.
            pdf link
            10 V. F. Farias, D. Saure, and G. Y. Weintraub. “ An Approximate Dynamic Programming Approach to Solving Dynamic Oligopoly Models ” RAND Journal of Economics, 43, No. 2 (2012): 253-282.
              2009 INFORMS JFIG Paper Competition, second place.
              pdf link
              9 D. Bertsimas, V. F. Farias, and N. Trichakis. “ The Price of Fairness. ” Operations Research, 59, No. 1 (2011): 17-31. pdf link
              8 V. F. Farias, R. Madan. “ Irrevocable Multi-Armed Bandit Policies. ” Operations Research, 59, No. 2 (2011): 383-399. pdf link
              7 V. F. Farias, B. Van Roy. “An Approximate Dynamic Programming Approach to Network Revenue Management.” Submitted. pdf link
              6 V. F. Farias, B. Van Roy. “Dynamic Pricing with a Prior on Market Response.” Operations Research, 58, No. 1 (2010): 16-29.
                2006 INFORMS MSOM Student Paper Competition, second place.
                pdf link
                5 V. F. Farias, C. C. Moallemi, B. Van Roy, and T. Weissman. “ Universal Reinforcement Learning.” IEEE Transactions on Information Theory, 56, No. 5 (2010): 2441-2454.
                Preliminary version:
                • V. F. Farias, C. C. Moallemi, B. Van Roy, and T. Weissman. “ A Universal Scheme for Learning.” Proceedings of the IEEE International Symposium on Information Theory, Adelaide, Australia, September 2005.
                pdf link
                4 C. W. Chan, V. F. Farias. “ Stochastic Depletion Problems: Effective Myopic Policies for a class of Dynamic Optimization Problems.” Mathematics of Operations Research, 34, No. 2 (2009): 333-350. pdf link
                3 V. F. Farias, C. C. Moallemi, and B. Prabhakar. “Load Balancing with Migration Penalties.” Proceedings of the IEEE International Symposium on Information Theory, Adelaide, Australia, September 2005. pdf link
                2 V. F. Farias, B. Van Roy. “Approximation Algorithms for Dynamic Resource Allocation.” Operations Research Letters, 34, No. 2 (2006): 180-190. pdf link
                1 V. F. Farias, B. Van Roy. “Tetris: A Study of Randomized Constraint Sampling.” Probabilistic and Randomized Methods for Design Under Uncertainty, Springer Science & Business Media, 2006. [Tetris Demo] pdf link
                Thesis
                V.F. Farias. “Revenue Management Beyond "Estimate, Then Optimize"” Stanford University Ph. D. Thesis, 2007. pdf link