Itay Gurvich

Orcid: 0000-0001-9746-7755

According to our database1, Itay Gurvich authored at least 30 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Dynamic Matching: Characterizing and Achieving Constant Regret.
Manag. Sci., 2024

A Low-Rank Approximation for MDPs via Moment Coupling.
Oper. Res., 2024

2022
Policy robustness in queueing networks.
Queueing Syst. Theory Appl., 2022

Optimal Dynamic Appointment Scheduling of Base and Surge Capacity.
Manuf. Serv. Oper. Manag., 2022

On the Optimality of Greedy Policies in Dynamic Matching.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

2021
Online Allocation and Pricing: Constant Regret via Bellman Inequalities.
Oper. Res., 2021

2020
Collaboration, Interruptions, and Changeover Times: Workflow Model and Empirical Study of Hospitalist Charting.
Manuf. Serv. Oper. Manag., 2020

On the Taylor Expansion of Value Functions.
Oper. Res., 2020

Low-rank MDP Approximation via Moment Coupling.
CoRR, 2020

2019
Coverage, Coarseness, and Classification: Determinants of Social Efficiency in Priority Queues.
Manag. Sci., 2019

2018
Learning by Doing versus Learning by Viewing: An Empirical Study of Data Analyst Productivity on a Collaborative Platform at eBay.
Proc. ACM Hum. Comput. Interact., 2018

Collaboration and Multitasking in Networks: Prioritization and Achievable Capacity.
Manag. Sci., 2018

Beyond Heavy-Traffic Regimes: Universal Bounds and Controls for the Single-Server Queue.
Oper. Res., 2018

2017
Call Center Staffing: Service-Level Constraints and Index Priorities.
Oper. Res., 2017

Uniformly bounded regret in the multi-secretary problem.
CoRR, 2017

2016
Hospital Readmissions Reduction Program: An Economic and Operational Analysis.
Manag. Sci., 2016

2015
Collaboration and Multitasking in Networks: Architectures, Bottlenecks, and Capacity.
Manuf. Serv. Oper. Manag., 2015

2014
Excursion-Based Universal Approximations for the Erlang-A Queue in Steady-State.
Math. Oper. Res., 2014

Validity of Heavy-Traffic Steady-State Approximations in Multiclass Queueing Networks: The Case of Queue-Ratio Disciplines.
Math. Oper. Res., 2014

2012
Overflow Networks: Approximations and Implications to Call Center Outsourcing.
Oper. Res., 2012

2011
Centralized vs. Decentralized Ambulance Diversion: A Network Perspective.
Manag. Sci., 2011

"We Will Be Right with You": Managing Customer Expectations with Vague Promises and Cheap Talk.
Oper. Res., 2011

2010
When Promotions Meet Operations: Cross-Selling and Its Effect on Call Center Performance.
Manuf. Serv. Oper. Manag., 2010

Pricing and Dimensioning Competing Large-Scale Service Providers.
Manuf. Serv. Oper. Manag., 2010

Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach.
Manag. Sci., 2010

Service-Level Differentiation in Many-Server Service Systems via Queue-Ratio Routing.
Oper. Res., 2010

2009
Scheduling Flexible Servers with Convex Delay Costs in Many-Server Service Systems.
Manuf. Serv. Oper. Manag., 2009

Queue-and-Idleness-Ratio Controls in Many-Server Service Systems.
Math. Oper. Res., 2009

Cross-Selling in a Call Center with a Heterogeneous Customer Population.
Oper. Res., 2009

2008
Service-Level Differentiation in Call Centers with Fully Flexible Servers.
Manag. Sci., 2008


  Loading...