default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAssaf Zeevi
Assaf J. Zeevi
Person information
- affiliation: Columbia University, New York City, NY, USA
- affiliation (former): Technion - Israel Institute of Technology
- affiliation (former, PhD 2001): Stanford University, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j39]Dongwook Shin
, Assaf Zeevi:
Product Quality and Information Sharing in the Presence of Reviews. Manag. Sci. 70(3): 1428-1447 (2024)- [c30]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
A Doubly Robust Approach to Sparse Reinforcement Learning. AISTATS 2024: 2305-2313 - [i23]Alexander Goldenshluger, Yaakov Malinovsky, Assaf Zeevi:
Optimal single threshold stopping rules and sharp prophet inequalities. CoRR abs/2404.12949 (2024) - 2023
- [j38]Dongwook Shin, Stefano Vaccari, Assaf Zeevi:
Dynamic Pricing with Online Reviews. Manag. Sci. 69(2): 824-845 (2023) - [c29]Anand Kalvit, Assaf Zeevi:
Complexity Analysis of a Countable-armed Bandit Problem. ALT 2023: 850-890 - [c28]Ayoub Foussoul, Vineet Goyal, Orestis Papadigenopoulos, Assaf Zeevi:
Last Switch Dependent Bandits with Monotone Payoff Functions. ICML 2023: 10265-10284 - [c27]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback. ICML 2023: 16458-16501 - [c26]Yunbei Xu, Assaf Zeevi:
Bayesian Design Principles for Frequentist Sequential Learning. ICML 2023: 38768-38800 - [i22]Anand Kalvit, Assaf Zeevi:
Complexity Analysis of a Countable-armed Bandit Problem. CoRR abs/2301.07243 (2023) - [i21]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
Improved Algorithms for Multi-period Multi-class Packing Problems with~Bandit~Feedback. CoRR abs/2301.13791 (2023) - [i20]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
Pareto Front Identification with Regret Minimization. CoRR abs/2306.00096 (2023) - [i19]Ayoub Foussoul, Vineet Goyal, Orestis Papadigenopoulos, Assaf Zeevi:
Last Switch Dependent Bandits with Monotone Payoff Functions. CoRR abs/2306.00338 (2023) - [i18]Vineet Goyal, Salal Humair, Orestis Papadigenopoulos, Assaf Zeevi:
MNL-Prophet: Sequential Assortment Selection under Uncertainty. CoRR abs/2308.05207 (2023) - [i17]Yunbei Xu, Assaf Zeevi:
Bayesian Design Principles for Frequentist Sequential Learning. CoRR abs/2310.00806 (2023) - [i16]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
A Doubly Robust Approach to Sparse Reinforcement Learning. CoRR abs/2310.15286 (2023) - 2022
- [j37]Dongwook Shin, Mark Broadie, Assaf Zeevi:
Practical Nonparametric Sampling Strategies for Quantile-Based Ordinal Optimization. INFORMS J. Comput. 34(2): 752-768 (2022) - [j36]Alexander Goldenshluger, Assaf Zeevi:
Optimal Stopping of a Random Sequence with Unknown Distribution. Math. Oper. Res. 47(1): 29-49 (2022) - [j35]Anand Kalvit, Assaf Zeevi:
Dynamic Learning in Large Matching Markets. SIGMETRICS Perform. Evaluation Rev. 50(2): 18-20 (2022) - [c25]Anand Kalvit, Assaf Zeevi:
Bandits with Dynamic Arm-acquisition Costs*. Allerton 2022: 1-7 - [c24]Anand Kalvit, Assaf Zeevi:
Dynamic Learning in Large Matching Markets. NeurIPS 2022 - [c23]Steven Yin, Shipra Agrawal, Assaf Zeevi:
Online Allocation and Learning in the Presence of Strategic Agents. NeurIPS 2022 - [c22]Vikas Deep, Achal Bassamboo, Sandeep Juneja, Assaf Zeevi:
Exact Optimal Fixed Width Confidence Interval Estimation for the Mean. WSC 2022: 713-723 - [i15]Steven Yin, Shipra Agrawal, Assaf Zeevi:
Online Allocation and Learning in the Presence of Strategic Agents. CoRR abs/2209.12112 (2022) - 2021
- [c21]Daniel Russo, Assaf Zeevi, Tianyi Zhang:
Learning to Stop with Surprisingly Few Samples. COLT 2021: 3887-3888 - [c20]Min-hwan Oh, Garud Iyengar, Assaf Zeevi:
Sparsity-Agnostic Lasso Bandit. ICML 2021: 8271-8280 - [c19]Anand Kalvit, Assaf Zeevi:
A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms. NeurIPS 2021: 8807-8819 - [c18]Shipra Agrawal, Steven Yin, Assaf Zeevi:
Dynamic Pricing and Learning under the Bass Model. EC 2021: 2-3 - [i14]Daniel Russo, Assaf Zeevi, Tianyi Zhang:
Learning to Stop with Surprisingly Few Samples. CoRR abs/2102.10025 (2021) - [i13]Shipra Agrawal, Steven Yin, Assaf Zeevi:
Dynamic Pricing and Learning under the Bass Model. CoRR abs/2103.05199 (2021) - [i12]Anand Kalvit, Assaf Zeevi:
From Finite to Countable-Armed Bandits. CoRR abs/2105.10721 (2021) - [i11]Anand Kalvit, Assaf Zeevi:
A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms. CoRR abs/2106.02126 (2021) - [i10]Anand Kalvit, Assaf Zeevi:
The Countable-armed Bandit with Vanishing Arms. CoRR abs/2110.12118 (2021) - 2020
- [c17]Anand Kalvit, Assaf Zeevi:
From Finite to Countable-Armed Bandits. NeurIPS 2020 - [c16]Yunbei Xu, Assaf Zeevi:
Towards Problem-dependent Optimal Learning Rates. NeurIPS 2020 - [i9]Achal Bassamboo, Vikas Deep, Sandeep Juneja, Assaf Zeevi:
Discriminative Learning via Adaptive Questioning. CoRR abs/2004.05442 (2020) - [i8]Yunbei Xu, Assaf Zeevi:
Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits. CoRR abs/2007.07876 (2020) - [i7]Min-hwan Oh, Garud Iyengar, Assaf Zeevi:
Sparsity-Agnostic Lasso Bandit. CoRR abs/2007.08477 (2020) - [i6]Yunbei Xu, Assaf Zeevi:
Towards Optimal Problem Dependent Generalization Error Bounds in Statistical Learning Theory. CoRR abs/2011.06186 (2020)
2010 – 2019
- 2019
- [j34]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
MNL-Bandit: A Dynamic Learning Approach to Assortment Selection. Oper. Res. 67(5): 1453-1485 (2019) - 2018
- [j33]N. Bora Keskin, Assaf Zeevi:
On Incomplete Learning and Certainty-Equivalence Control. Oper. Res. 66(4): 1136-1167 (2018) - [j32]Dongwook Shin, Mark Broadie, Assaf Zeevi:
Tractable Sampling Strategies for Ordinal Optimization. Oper. Res. 66(6): 1693-1712 (2018) - [j31]Constantinos Maglaras, John Yao, Assaf Zeevi:
Optimal Price and Delay Differentiation in Large-Scale Queueing Systems. Manag. Sci. 64(5): 2427-2444 (2018) - [c15]Asaf B. Cassel, Shie Mannor, Assaf Zeevi:
A General Approach to Multi-Armed Bandits Under Risk Criteria. COLT 2018: 1295-1306 - [i5]Asaf B. Cassel, Shie Mannor, Assaf Zeevi:
A General Approach to Multi-Armed Bandits Under Risk Criteria. CoRR abs/1806.01380 (2018) - 2017
- [j30]N. Bora Keskin, Assaf Zeevi:
Chasing Demand: Learning and Earning in a Changing Environment. Math. Oper. Res. 42(2): 277-307 (2017) - [c14]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
Thompson Sampling for the MNL-Bandit. COLT 2017: 76-78 - [i4]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
Thompson Sampling for the MNL-Bandit. CoRR abs/1706.00977 (2017) - [i3]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
MNL-Bandit: A Dynamic Learning Approach to Assortment Selection. CoRR abs/1706.03880 (2017) - 2016
- [j29]Omar Besbes, Yonatan Gur, Assaf Zeevi:
Optimization in Online Content Recommendation Services: Beyond Click-Through Rates. Manuf. Serv. Oper. Manag. 18(1): 15-33 (2016) - [j28]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): 612-617 (2016) - [c13]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
A Near-Optimal Exploration-Exploitation Approach for Assortment Selection. EC 2016: 599-600 - [c12]Dongwook Shin, Mark Broadie, Assaf Zeevi:
Tractable sampling strategies for quantile-based ordinal optimization. WSC 2016: 847-858 - 2015
- [j27]Omar Besbes, Yonatan Gur, Assaf Zeevi:
Non-Stationary Stochastic Optimization. Oper. Res. 63(5): 1227-1244 (2015) - [j26]Omar Besbes, Assaf Zeevi:
On the (Surprising) Sufficiency of Linear Models for Dynamic Pricing with Demand Learning. Manag. Sci. 61(4): 723-739 (2015) - [c11]Oren Anava, Elad Hazan, Assaf Zeevi:
Online Time Series Prediction with Missing Data. ICML 2015: 2191-2199 - 2014
- [j25]N. Bora Keskin, Assaf Zeevi:
Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies. Oper. Res. 62(5): 1142-1167 (2014) - [j24]Mark Broadie, Deniz M. Cicek, Assaf Zeevi:
Multidimensional stochastic approximation: Adaptive algorithms and applications. ACM Trans. Model. Comput. Simul. 24(1): 6:1-6:28 (2014) - [c10]Yonatan Gur, Assaf Zeevi, Omar Besbes:
Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards. NIPS 2014: 199-207 - [i2]Omar Besbes, Yonatan Gur, Assaf Zeevi:
Optimal Exploration-Exploitation in a Multi-Armed-Bandit Problem with Non-stationary Rewards. CoRR abs/1405.3316 (2014) - 2013
- [j23]Denis Sauré, Assaf Zeevi:
Optimal Dynamic Assortment Planning with Demand Learning. Manuf. Serv. Oper. Manag. 15(3): 387-404 (2013) - [i1]Omar Besbes, Yonatan Gur, Assaf Zeevi:
Non-stationary Stochastic Optimization. CoRR abs/1307.5449 (2013) - 2012
- [j22]Omar Besbes, Assaf Zeevi:
Blind Network Revenue Management. Oper. Res. 60(6): 1537-1550 (2012) - [j21]J. Michael Harrison, N. Bora Keskin, Assaf Zeevi:
Bayesian Dynamic Pricing Policies: Learning and Earning Under a Binary Prior Distribution. Manag. Sci. 58(3): 570-586 (2012) - 2011
- [j20]Omar Besbes, Assaf Zeevi:
On the Minimax Complexity of Pricing in a Changing Environment. Oper. Res. 59(1): 66-79 (2011) - [j19]Mark Broadie, Deniz M. Cicek, Assaf Zeevi:
General Bounds and Finite-Time Improvement for the Kiefer-Wolfowitz Stochastic Approximation Algorithm. Oper. Res. 59(5): 1211-1224 (2011) - [j18]Alexander Goldenshluger, Assaf Zeevi:
A Note on Performance Limitations in Bandit Problems With Side Information. IEEE Trans. Inf. Theory 57(3): 1707-1713 (2011) - 2010
- [j17]Achal Bassamboo, Ramandeep S. Randhawa, Assaf Zeevi:
Capacity Sizing Under Parameter Uncertainty: Safety Staffing Principles Revisited. Manag. Sci. 56(10): 1668-1686 (2010) - [j16]Omar Besbes, Robert Phillips, Assaf Zeevi:
Testing the Validity of a Demand Model: An Operations Perspective. Manuf. Serv. Oper. Manag. 12(1): 162-183 (2010) - [j15]Ana Radovanovic, Assaf Zeevi:
Revenue maximization through "smart" inventory management in reservation-based online advertising. SIGMETRICS Perform. Evaluation Rev. 38(2): 33-35 (2010) - [c9]Ana Radovanovic, Assaf Zeevi:
Revenue maximization in reservation-based online advertising through dynamic inventory management. Allerton 2010: 1502-1509 - [c8]Philippe Rigollet, Assaf Zeevi:
Nonparametric Bandits with Covariates. COLT 2010: 54-66 - [c7]Denis Sauré, Anshul Sheopuri, Huiming Qu, Hani Jamjoom, Assaf Zeevi:
Time-of-Use pricing policies for offering Cloud Computing as a service. SOLI 2010: 300-305
2000 – 2009
- 2009
- [j14]Achal Bassamboo, Assaf Zeevi:
On a Data-Driven Method for Staffing Large Call Centers. Oper. Res. 57(3): 714-726 (2009) - [j13]Omar Besbes, Assaf Zeevi:
Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms. Oper. Res. 57(6): 1407-1420 (2009) - [j12]Achal Bassamboo, J. Michael Harrison, Assaf Zeevi:
Pointwise Stationary Fluid Models for Stochastic Processing Networks. Manuf. Serv. Oper. Manag. 11(1): 70-89 (2009) - [c6]Mark Broadie, Deniz M. Cicek, Assaf Zeevi:
An Adaptive Multidimensional Version of the Kiefer-Wolfowitz Stochastic Approximation Algorithm. WSC 2009: 601-612 - 2008
- [j11]Achal Bassamboo, Sandeep Juneja, Assaf Zeevi:
Portfolio Credit Risk with Extremal Dependence: Asymptotic Analysis and Efficient Simulation. Oper. Res. 56(3): 593-606 (2008) - 2007
- [j10]Achal Bassamboo, Sandeep Juneja, Assaf Zeevi:
On the inefficiency of state-independent importance sampling in the presence of heavy tails. Oper. Res. Lett. 35(2): 251-260 (2007) - [c5]Mark Broadie, Minsup Han, Assaf Zeevi:
Implications of heavy tails on simulation-based ordinal optimization. WSC 2007: 439-447 - 2006
- [j9]Achal Bassamboo, J. Michael Harrison, Assaf Zeevi:
Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method. Oper. Res. 54(3): 419-435 (2006) - 2005
- [j8]Constantinos Maglaras, Assaf Zeevi:
Pricing and Design of Differentiated Services: Approximate Analysis and Structural Insights. Oper. Res. 53(2): 242-262 (2005) - [j7]J. Michael Harrison, Assaf Zeevi:
A Method for Staffing Large Call Centers Based on Stochastic Fluid Models. Manuf. Serv. Oper. Manag. 7(1): 20-36 (2005) - [j6]Achal Bassamboo, J. Michael Harrison, Assaf Zeevi:
Dynamic Routing and Admission Control in High-Volume Service Systems: Asymptotic Analysis via Multi-Scale Fluid Limits. Queueing Syst. Theory Appl. 51(3-4): 249-285 (2005) - [c4]Achal Bassamboo, Sandeep Juneja, Assaf Zeevi:
Importance sampling simulation in the presence of heavy tails. WSC 2005: 664-672 - [c3]Achal Bassamboo, Sandeep Juneja, Assaf Zeevi:
Expected shortfall in credit portfolios with extremal dependence. WSC 2005: 1849-1858 - 2004
- [j5]J. Michael Harrison, Assaf Zeevi:
Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime. Oper. Res. 52(2): 243-257 (2004) - [j4]Constantinos Maglaras, Assaf Zeevi:
Diffusion Approximations for a Multiclass Markovian Service System with "Guaranteed" and "Best-Effort" Service Levels. Math. Oper. Res. 29(4): 786-813 (2004) - 2003
- [j3]Constantinos Maglaras, Assaf Zeevi:
Pricing and Capacity Sizing for Systems with Shared Resources: Approximate Solutions and Scaling Relations. Manag. Sci. 49(8): 1018-1038 (2003)
1990 – 1999
- 1998
- [j2]Assaf J. Zeevi, Ron Meir, Vitaly Maiorov:
Error Bounds for Functional Approximation and Estimation Using Mixtures of Experts. IEEE Trans. Inf. Theory 44(3): 1010-1025 (1998) - [c2]Assaf J. Zeevi:
On the Performance of Vector Quantizers Empirically Designed from Dependent Sources. Data Compression Conference 1998: 73-82 - 1997
- [j1]Assaf J. Zeevi, Ronny Meir:
Density Estimation Through Convex Combinations of Densities: Approximation and Estimation Bounds. Neural Networks 10(1): 99-109 (1997) - 1996
- [c1]Assaf J. Zeevi, Ron Meir, Robert J. Adler:
Time Series Prediction using Mixtures of Experts. NIPS 1996: 309-318
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-05 20:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
