Binyamin Oz

Binyamin Oz
Hebrew University of Jerusalem | HUJI · School of Business Administration

PhD

About

13
Publications
536
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
54
Citations

Publications

Publications (13)
Article
We consider an unobservable M/G/1 queue with accumulating priorities and strategic customers who pay for priority accumulation rates. We show that when affine pricing is introduced, multiple equilibria may exist. This is in contrast to the standard linear pricing case where the equilibrium strategy is unique. Furthermore, a revenue-maximizing opera...
Article
Full-text available
The traditional approach when looking for a symmetric equilibrium behavior in queueing models with strategic customers who arrive according to some stationary arrival process is to look for a strategy which, if used by all, is also a best response of an individual customer under the resulting stochastic steady-state conditions. This description lac...
Article
The question of priorities naturally arises when optimizing service systems with heterogeneous customers. If heterogeneity is with respect to time sensitivity and social welfare is of interest, it is well known that the Cμ‐rule is optimal in the sense that customers with high time sensitivity should be prioritized. This, for example, justifies prio...
Preprint
Amid unprecedented times caused by COVID-19, healthcare systems all over the world are strained to the limits of, or even beyond, capacity. A similar event is experienced by some healthcare systems regularly, due to for instance seasonal spikes in the number of patients. We model this as a queueing system in heavy traffic (where the arrival rate is...
Article
We consider the M n /G n /1 queue with vacations and exhaustive service in which the server takes (repeated) vacations whenever it becomes idle, the service time distribution is queue length dependent, and the arrival rate varies both with the queue length and with the status of the server, being busy or on vacation. Using a rate balance principle,...
Article
We consider an unobservable M/G/1 accumulating priority queue where homogeneous customers choose one of a finite number of priority classes. We show that there are either one or two pure Nash equilibrium strategies. In the latter case they are two consecutive classes and there exists an equilibrium strategy mixing between these two classes. We find...
Article
Full-text available
We introduce a rate balance principle for general (not necessarily Markovian) stochastic processes. Special attention is given to processes with birth and death like transitions, for which it is shown that for any state $i$, the rate of two consecutive transitions from $i-1$ to $i+1$, coincides with the corresponding rate from $i+1$ to $i-1$. This...
Article
We show that relative priorities can reduce queueing costs in systems that are multi-server and multi-class as long as customers choose their routing policy strategically. This is demonstrated in two models with multi-class Poisson arrivals and parallel memoryless servers with linear cost functions of class mean waiting times. For each model we inv...
Article
We consider an unobservable M/M/1 queue where customers are homogeneous with respect to service valuation and cost per unit time of waiting. It is well known that left to themselves, in equilibrium, customers join the queue at a rate higher than is socially optimal. Hence, regulation schemes, under which the resulting equilibrium joining rate coinc...
Article
Naor (1969) was the first to observe that in observable queues, customers’ joining behavior may not coincide with the socially optimal one. The question then is how to regulate the system such that customers, while minding their own utility, will decide to join only when it is advised by society. After reviewing some existing mechanisms (some invol...

Network

Cited By