25 citations · 88 across the 20 of their papers we have counts for
25 papers
Structure-Aware Online Optimization of the Age of Information with Unknown System Statistics
Yoshiaki Inoue, Michel Mandjes, Liron Ravner
Timely information dissemination is essential in modern communication systems, where low informational latency is critical for networked control, monitoring, and real-time decision…
Dynamic Core Allocation for Malleable Jobs with Unknown Speed-up Parameters
Shreehari Anand Bodas, Jan-Pieter Dorsman, Michel Mandjes +1
We study dynamic resource allocation in a multicore computing system with a fixed number of processing cores and a stream of malleable jobs. Each job may adjust its level of parall…
Using memory to control admission to unobservable queues
Refael Hassin, Liron Ravner
We study admission control to an unobservable M/M/1 queue. A memoryless controller can only randomly thin arrivals (random routing, RR). We show that a gated admission (GA) policy,…
Departure Time Choice with Parametric Heterogeneity: Equilibrium and Instability
Hillel Bar-Gera, Stephen D. Boyles, Liron Ravner
Vickrey's classic single-bottleneck departure time choice equilibrium model exhibits instability under many plausible day-to-day learning dynamics. Such instability is not observed…
A stochastic optimization algorithm for revenue maximization in a service system with balking customers
Shreehari Anand Bodas, Harsha Honnappa, Michel Mandjes +1
This paper analyzes a service system modeled as a single-server queue, in which the service provider aims to dynamically maximize the expected revenue per unit of time. This is ach…
Uncovering the topology of an infinite-server queueing network from population data
Hritika Gupta, Michel Mandjes, Liron Ravner +1
This paper studies statistical inference in a network of infinite-server queues, with the aim of estimating the underlying parameters (routing matrix, arrival rates, parameters per…
Estimation of service value parameters for a queue with unobserved balking
Daniel Podorojnyi, Liron Ravner
In Naor's model [17], customers decide whether or not to join a queue after observing its length. This work considers a variation in which customers are heterogeneous in their serv…
Statistical inference for a service system with non-stationary arrivals and unobserved balking
Shreehari Anand Bodas, Michel Mandjes, Liron Ravner
We study a multi-server queueing system with a periodic arrival rate and customers whose joining decision is based on their patience and a delay proxy. Specifically, each customer…
Nonparametric estimation of the job-size distribution for an M/G/1 queue with Poisson sampling
Liron Ravner
This work presents a non-parametric estimator for the cumulative distribution function (CDF) of the job-size distribution for a queue with compound Poisson input. The workload proc…
Input estimation from discrete workload observations in a Lévy-driven storage system
Dennis Nieman, Michel Mandjes, Liron Ravner
Our goal is to estimate the characteristic exponent of the input to a Lévy-driven storage system from a sample of equispaced workload observations. The estimator relies on an appro…
Queue input estimation from discrete workload observations
Liron Ravner
This note considers the problem of statistical inference of the parameters of the input process to a queue from periodic workload observations. The main focus is the open problem o…
Estimating customer delay and tardiness sensitivity from periodic queue length observations
Liron Ravner, Jiesen Wang
A single server commences its service at time zero every day. A random number of customers decide when to arrive to the system so as to minimize the waiting time and tardiness cost…
Stochastic approximation of symmetric Nash equilibria in queueing games
Liron Ravner, Ran I. Snitkovsky
We suggest a novel stochastic-approximation algorithm to compute a symmetric Nash-equilibrium strategy in a general queueing game with a finite action space. The algorithm involves…
A survey of queueing systems with strategic timing of arrivals
Moshe Haviv, Liron Ravner
Consider a population of customers each of which needs to decide independently when to arrive to a facility that provides a service during a fixed period of time, say a day. This i…
Estimating customer impatience in a service system with unobserved balking
Yoshiaki Inoue, Liron Ravner, Michel Mandjes
This paper studies a service system in which arriving customers are provided with information about the delay they will experience. Based on this information they decide to wait fo…
Hypothesis testing for a Lévy-driven storage system by Poisson sampling
Michel Mandjes, Liron Ravner
This paper focuses on hypothesis testing for the input of a Lévy-driven storage system by sampling of the storage level. As the likelihood is not explicit we propose two tests that…
Strategic arrivals to a queue with service rate uncertainty
Liron Ravner, Yutaka Sakuma
We study the problem of strategic choice of arrival time to a single-server queue with opening and closing times when there is uncertainty regarding service speed. A Poisson popula…
Estimating the input of a Lévy-driven queue by Poisson sampling of the workload process
Liron Ravner, Onno Boxma, Michel Mandjes
This paper aims at semi-parametrically estimating the input process to a Lévy-driven queue by sampling the workload process at Poisson times. We construct a method-of-moments based…
A strategic model of job arrivals to a single machine with earliness and tardiness penalties
Amihai Glazer, Refael Hassin, Liron Ravner
We consider a game of decentralized timing of jobs to a single server (machine) with a penalty for deviation from a due date, and no delay costs. The jobs' sizes are homogeneous an…
Delay-minimizing capacity allocation in an infinite server queueing system
Refael Hassin, Liron Ravner
We consider a service system with an infinite number of exponential servers sharing a finite service capacity. The servers are ordered according to their speed, and arriving custom…
Lowest priority waiting time distribution in an accumulating priority Lévy queue
Offer Kella, Liron Ravner
This paper presents a new method for deriving the waiting time distribution of the lowest class in an accumulating priority (AP) queue with positive Lévy input. The priority of a n…
Strategic Bidding in an Accumulating Priority Queue: Equilibrium Analysis
Moshe Haviv, Liron Ravner
We study the strategic purchasing of priorities in a time-dependent accumulating priority M/G/ queue. We formulate a non-cooperative game in which customers purchase priority co…
A strategic timing of arrivals to a linear slowdown processor sharing system
Liron Ravner, Moshe Haviv, Hai L. Vu
We consider a discrete population of users with homogeneous service demand who need to decide when to arrive to a system in which the service rate deteriorates linearly with the nu…
Scheduling for a Processor Sharing System with Linear Slowdown
Liron Ravner, Yoni Nazarathy
We consider the problem of scheduling arrivals to a congestion system with a finite number of users having identical deterministic demand sizes. The congestion is of the processor…