Vivek F. Farias

Orcid: 0000-0002-5856-9246

According to our database1, Vivek F. Farias authored at least 45 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Policy Optimization for Personalized Interventions in Behavioral Health.
CoRR, 2023

Correcting for Interference in Experiments: A Case Study at Douyin.
Proceedings of the 17th ACM Conference on Recommender Systems, 2023

TS-UCB: Improving on Thompson Sampling With Little to No Additional Computation.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Optimistic Gittins Indices.
Oper. Res., November, 2022

Synthetically Controlled Bandits.
CoRR, 2022

Markovian Interference in Experiments.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Uncertainty Quantification for Low-Rank Matrix Completion with Heterogeneous and Sub-Exponential Noise.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Assortment Optimization Under Consider-Then-Choose Choice Models.
Manag. Sci., 2021

The Limits to Learning a Diffusion Model.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Learning Treatment Effects in Panels with General Intervention Patterns.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Fair Exploration via Axiomatic Bargaining.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Near-Optimal Entrywise Anomaly Detection for Low-Rank Matrices with Sub-Exponential Noise.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Near-Optimal A-B Testing.
Manag. Sci., 2020

Solving the Phantom Inventory Problem: Near-optimal Entry-wise Anomaly Detection.
CoRR, 2020

The Limits to Learning an SIR Process: Granular Forecasting for Covid-19.
CoRR, 2020

Optimizing Offer Sets in Sub-Linear Time.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

2019
Learning Preferences with Side Information.
Manag. Sci., 2019

On the Efficacy of Static Prices for Revenue Management in the Face of Strategic Customers.
Manag. Sci., 2019

Primal-Dual Algorithms for Order Fulfillment at Urban Outfitters, Inc.
INFORMS J. Appl. Anal., 2019

2018
Robust Dynamic Pricing with Strategic Customers.
Math. Oper. Res., 2018

The Approximability of Assortment Optimization Under Ranking Preferences.
Oper. Res., 2018

2017
The Impact of Delays on Service Times in the Intensive Care Unit.
Manag. Sci., 2017

Optimal Recovery of Tensor Slices.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016
On the Efficacy of Static Prices for Revenue Management in the Face of Strategic Customers.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2013
A Nonparametric Approach to Modeling Choice with Limited Data.
Manag. Sci., 2013

Simple Policies for Dynamic Pricing with Imperfect Forecasts.
Oper. Res., 2013

Fairness, Efficiency, and Flexibility in Organ Allocation for Kidney Transplantation.
Oper. Res., 2013

2012
Model Predictive Control for Dynamic Resource Allocation.
Math. Oper. Res., 2012

Pathwise Optimization for Optimal Stopping Problems.
Manag. Sci., 2012

On the Efficiency-Fairness Trade-off.
Manag. Sci., 2012

Approximate Dynamic Programming via a Smoothed Linear Program.
Oper. Res., 2012

Optimizing Intensive Care Unit Discharge Decisions with Patient Readmissions.
Oper. Res., 2012

Non-parametric Approximate Dynamic Programming via the Kernel Method.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Sparse choice models.
Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

2011
The Irrevocable Multiarmed Bandit Problem.
Oper. Res., 2011

The Price of Fairness.
Oper. Res., 2011

2010
Universal reinforcement learning.
IEEE Trans. Inf. Theory, 2010

Dynamic Pricing with a Prior on Market Response.
Oper. Res., 2010

A two tiered dynamic oligopoly model.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009
Stochastic Depletion Problems: Effective Myopic Policies for a Class of Dynamic Optimization Problems.
Math. Oper. Res., 2009

A Data-Driven Approach to Modeling Choice.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

A Smoothed Approximate Linear Program.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

2006
Approximation algorithms for dynamic resource allocation.
Oper. Res. Lett., 2006

2005
A universal scheme for learning.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Load balancing with migration penalties.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005


  Loading...