collaborators

7 papers

math.OC2026

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…

math.PR2026

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,…

cs.GT2026

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…

math.ST2026

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…

math.OC2026

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…

math.ST2025

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…