Assaf Zeevi

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 51

Top Topics

Discriminative Learning

Packing Problem

Payoff Functions

Sampling Strategies

Top Venues

Publications

Dongwook Shin, Assaf Zeevi
Product Quality and Information Sharing in the Presence of Reviews. Manag. Sci. 70 (3) (2024)
Wonyoung Kim, Garud Iyengar, Assaf Zeevi
A Doubly Robust Approach to Sparse Reinforcement Learning. AISTATS (2024)
Alexander Goldenshluger, Yaakov Malinovsky, Assaf Zeevi
Optimal single threshold stopping rules and sharp prophet inequalities. CoRR (2024)
Ayoub Foussoul, Vineet Goyal, Orestis Papadigenopoulos, Assaf Zeevi
Last Switch Dependent Bandits with Monotone Payoff Functions. ICML (2023)
Anand Kalvit, Assaf Zeevi
Complexity Analysis of a Countable-armed Bandit Problem. CoRR (2023)
Ayoub Foussoul, Vineet Goyal, Orestis Papadigenopoulos, Assaf Zeevi
Last Switch Dependent Bandits with Monotone Payoff Functions. CoRR (2023)
Vineet Goyal, Salal Humair, Orestis Papadigenopoulos, Assaf Zeevi
MNL-Prophet: Sequential Assortment Selection under Uncertainty. CoRR (2023)
Dongwook Shin, Stefano Vaccari, Assaf Zeevi
Dynamic Pricing with Online Reviews. Manag. Sci. 69 (2) (2023)
Wonyoung Kim, Garud Iyengar, Assaf Zeevi
Improved Algorithms for Multi-period Multi-class Packing Problems with~Bandit~Feedback. CoRR (2023)
Wonyoung Kim, Garud Iyengar, Assaf Zeevi
A Doubly Robust Approach to Sparse Reinforcement Learning. CoRR (2023)
Yunbei Xu, Assaf Zeevi
Bayesian Design Principles for Frequentist Sequential Learning. CoRR (2023)
Anand Kalvit, Assaf Zeevi
Complexity Analysis of a Countable-armed Bandit Problem. ALT (2023)
Wonyoung Kim, Garud Iyengar, Assaf Zeevi
Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback. ICML (2023)
Wonyoung Kim, Garud Iyengar, Assaf Zeevi
Pareto Front Identification with Regret Minimization. CoRR (2023)
Yunbei Xu, Assaf Zeevi
Bayesian Design Principles for Frequentist Sequential Learning. ICML (2023)
Anand Kalvit, Assaf Zeevi
. Allerton (2022)
Dongwook Shin, Mark Broadie, Assaf Zeevi
Practical Nonparametric Sampling Strategies for Quantile-Based Ordinal Optimization. INFORMS J. Comput. 34 (2) (2022)
Vikas Deep, Achal Bassamboo, Sandeep Juneja, Assaf Zeevi
Exact Optimal Fixed Width Confidence Interval Estimation for the Mean. WSC (2022)
Steven Yin, Shipra Agrawal, Assaf Zeevi
Online Allocation and Learning in the Presence of Strategic Agents. NeurIPS (2022)
Steven Yin, Shipra Agrawal, Assaf Zeevi
Online Allocation and Learning in the Presence of Strategic Agents. CoRR (2022)
Anand Kalvit, Assaf Zeevi
Dynamic Learning in Large Matching Markets. NeurIPS (2022)
Alexander Goldenshluger, Assaf Zeevi
Optimal Stopping of a Random Sequence with Unknown Distribution. Math. Oper. Res. 47 (1) (2022)
Anand Kalvit, Assaf Zeevi
Dynamic Learning in Large Matching Markets. SIGMETRICS Perform. Evaluation Rev. 50 (2) (2022)
Anand Kalvit, Assaf Zeevi
A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms. CoRR (2021)
Anand Kalvit, Assaf Zeevi
A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms. NeurIPS (2021)
Daniel Russo, Assaf Zeevi, Tianyi Zhang
Learning to Stop with Surprisingly Few Samples. CoRR (2021)
Shipra Agrawal, Steven Yin, Assaf Zeevi
Dynamic Pricing and Learning under the Bass Model. CoRR (2021)
Anand Kalvit, Assaf Zeevi
From Finite to Countable-Armed Bandits. CoRR (2021)
Min-hwan Oh, Garud Iyengar, Assaf Zeevi
Sparsity-Agnostic Lasso Bandit. ICML (2021)
Shipra Agrawal, Steven Yin, Assaf Zeevi
Dynamic Pricing and Learning under the Bass Model. EC (2021)
Daniel Russo, Assaf Zeevi, Tianyi Zhang
Learning to Stop with Surprisingly Few Samples. COLT (2021)
Anand Kalvit, Assaf Zeevi
The Countable-armed Bandit with Vanishing Arms. CoRR (2021)
Min-hwan Oh, Garud Iyengar, Assaf Zeevi
Sparsity-Agnostic Lasso Bandit. CoRR (2020)
Achal Bassamboo, Vikas Deep, Sandeep Juneja, Assaf Zeevi
Discriminative Learning via Adaptive Questioning. CoRR (2020)
Yunbei Xu, Assaf Zeevi
Towards Problem-dependent Optimal Learning Rates. NeurIPS (2020)
Yunbei Xu, Assaf Zeevi
Towards Optimal Problem Dependent Generalization Error Bounds in Statistical Learning Theory. CoRR (2020)
Yunbei Xu, Assaf Zeevi
Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits. CoRR (2020)
Anand Kalvit, Assaf Zeevi
From Finite to Countable-Armed Bandits. NeurIPS (2020)
Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi
MNL-Bandit: A Dynamic Learning Approach to Assortment Selection. Oper. Res. 67 (5) (2019)
N. Bora Keskin, Assaf Zeevi
On Incomplete Learning and Certainty-Equivalence Control. Oper. Res. 66 (4) (2018)
Asaf Cassel, Shie Mannor, Assaf Zeevi
A General Approach to Multi-Armed Bandits Under Risk Criteria. CoRR (2018)
Dongwook Shin, Mark Broadie, Assaf Zeevi
Tractable Sampling Strategies for Ordinal Optimization. Oper. Res. 66 (6) (2018)
Constantinos Maglaras, John Yao, Assaf Zeevi
Optimal Price and Delay Differentiation in Large-Scale Queueing Systems. Manag. Sci. 64 (5) (2018)
Asaf Cassel, Shie Mannor, Assaf Zeevi
A General Approach to Multi-Armed Bandits Under Risk Criteria. COLT (2018)
Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi
MNL-Bandit: A Dynamic Learning Approach to Assortment Selection. CoRR (2017)
Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi
Thompson Sampling for the MNL-Bandit. COLT (2017)
N. Bora Keskin, Assaf Zeevi
Chasing Demand: Learning and Earning in a Changing Environment. Math. Oper. Res. 42 (2) (2017)
Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi
Thompson Sampling for the MNL-Bandit. CoRR (2017)
Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi
A Near-Optimal Exploration-Exploitation Approach for Assortment Selection. EC (2016)
Vashist Avadhanula, Jalaj Bhandari, Vineet Goyal, Assaf Zeevi
On the tightness of an LP relaxation for rational optimization and its applications. Oper. Res. Lett. 44 (5) (2016)
Oren Anava, Elad Hazan, Assaf Zeevi
Online Time Series Prediction with Missing Data. ICML (2015)
Mark Broadie, Deniz M. Cicek, Assaf Zeevi
Multidimensional stochastic approximation: Adaptive algorithms and applications. ACM Trans. Model. Comput. Simul. 24 (1) (2014)
Denis Sauré, Assaf Zeevi
Optimal Dynamic Assortment Planning with Demand Learning. Manuf. Serv. Oper. Manag. 15 (3) (2013)
Mark Broadie, Deniz M. Cicek, Assaf Zeevi
General Bounds and Finite-Time Improvement for the Kiefer-Wolfowitz Stochastic Approximation Algorithm. Oper. Res. 59 (5) (2011)
Alexander Goldenshluger, Assaf Zeevi
A Note on Performance Limitations in Bandit Problems With Side Information. IEEE Trans. Inf. Theory 57 (3) (2011)
Denis Sauré, Anshul Sheopuri, Huiming Qu, Hani Jamjoom, Assaf Zeevi
Time-of-Use pricing policies for offering Cloud Computing as a service. SOLI (2010)
Ana Radovanovic, Assaf Zeevi
Revenue maximization in reservation-based online advertising through dynamic inventory management. Allerton (2010)
Ana Radovanovic, Assaf Zeevi
Revenue maximization through "smart" inventory management in reservation-based online advertising. SIGMETRICS Perform. Evaluation Rev. 38 (2) (2010)
Philippe Rigollet, Assaf Zeevi
Nonparametric Bandits with Covariates. COLT (2010)
Mark Broadie, Deniz M. Cicek, Assaf Zeevi
An Adaptive Multidimensional Version of the Kiefer-Wolfowitz Stochastic Approximation Algorithm. WSC (2009)
Mark Broadie, Minsup Han, Assaf Zeevi
Implications of heavy tails on simulation-based ordinal optimization. WSC (2007)
J. Michael Harrison, Assaf Zeevi
A Method for Staffing Large Call Centers Based on Stochastic Fluid Models. Manuf. Serv. Oper. Manag. 7 (1) (2005)