Binyamin Oz

Orcid: 0000-0001-5180-9510

According to our database1, Binyamin Oz authored at least 14 papers between 2014 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Opaque service: the case of server selection by strategic customers.
Queueing Syst. Theory Appl., June, 2026

2023
Strategic behavior in queues with arrival rate uncertainty.
Eur. J. Oper. Res., August, 2023

Charging more for priority via two-part tariff for accumulating priorities.
Eur. J. Oper. Res., 2023

2022
Queueing models for addictive tasks.
Queueing Syst. Theory Appl., 2022

Optimal admission policy to an observable M/G/1 queue.
Queueing Syst. Theory Appl., 2022

2021
A busy period approach to some queueing games.
Queueing Syst. Theory Appl., 2021

2020
Static vs accumulating priorities in healthcare queues under heavy loads.
CoRR, 2020

2019
Strategic bidding in a discrete accumulating priority queue.
Oper. Res. Lett., 2019

The M<sub><i>n</i></sub>/G<sub><i>n</i></sub>/1 queue with vacations and exhaustive service.
Eur. J. Oper. Res., 2019

2018
Self-Regulation of an Unobservable Queue.
Manag. Sci., 2018

2017
A rate balance principle and its application to queueing models.
Queueing Syst. Theory Appl., 2017

The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers.
Oper. Res. Lett., 2017

2016
Regulating an observable M/M/1 queue.
Oper. Res. Lett., 2016

2014
Self and social optimization in multi-class multi-server queueing systems with relative priorities.
Proceedings of the 7th International Conference on NETwork Games, COntrol and OPtimization, 2014


  Loading...