Moshe Haviv

According to our database1, Moshe Haviv authored at least 51 papers between 1990 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

Choosing a batch to be processed.
Ann. Oper. Res., July, 2023

Signaling Service Quality Through Queue Disclosure.
Manuf. Serv. Oper. Manag., March, 2023

2022
Optimal timing of arrival to a queue.
Queueing Syst. Theory Appl., 2022

On equilibrium threshold strategies when choosing between observable and unobservable queues.
Oper. Res. Lett., 2022

Discrete-time strategic job arrivals to a single machine with waiting and lateness penalties.
Eur. J. Oper. Res., 2022

2021
A survey of queueing systems with strategic timing of arrivals.
Queueing Syst. Theory Appl., 2021

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

2020
An optimal mechanism charging for priority in a queue.
Oper. Res. Lett., 2020

Pooling Risk Games.
IGTR, 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

Cooperation and sharing costs in a tandem queueing network.
Eur. J. Oper. Res., 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
The performance of a single-server queue with preemptive random priorities.
Perform. Evaluation, 2016

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

A strategic timing of arrivals to a linear slowdown processor sharing system.
Eur. J. Oper. Res., 2016

Strategic bidding in an accumulating priority queue: equilibrium analysis.
Ann. Oper. Res., 2016

2015
Strategic timing of arrivals to a finite queue multi-server loss system.
Queueing Syst. Theory Appl., 2015

2014
Regulating an M/G/1 queue when customers know their demand.
Perform. Evaluation, 2014

Pricing in Queues Without Demand Information.
Manuf. Serv. Oper. Manag., 2014

Subadditive and Homogeneous of Degree One Games Are Totally Balanced.
Oper. Res., 2014

The M/G/1 queueing model with preemptive random priorities.
Proceedings of the 8th International Conference on Performance Evaluation Methodologies and Tools, 2014

Equilibrium and socially optimal arrivals to a single server loss system.
Proceedings of the 7th International Conference on NETwork Games, COntrol and OPtimization, 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

2013
When to arrive at a queue with tardiness costs?
Perform. Evaluation, 2013

2011
Computational schemes for two exponential servers where the first has a finite buffer.
RAIRO Oper. Res., 2011

The age of the arrival process in the G/M/1 and M/G/1 queues.
Math. Methods Oper. Res., 2011

2010
Cooperation in Service Systems.
Oper. Res., 2010

2009
Broadcasting forever.
Proceedings of the 1st International Conference on Game Theory for Networks, 2009

2008
Mean sojourn times for phase-type discriminatory processor sharing systems.
Eur. J. Oper. Res., 2008

2007
On balking from an empty queue.
Queueing Syst. Theory Appl., 2007

Waiting times in queues with relative priorities.
Oper. Res. Lett., 2007

The price of anarchy in an exponential multi-server.
Oper. Res. Lett., 2007

The Cost Allocation Problem for the First Order Interaction Joint Replenishment Model.
Oper. Res., 2007

2006
Who should be given priority in a queue?
Oper. Res. Lett., 2006

2003
Price and delay competition between two service providers.
Eur. J. Oper. Res., 2003

2002
Nash Equilibrium and Subgame Perfection in Observable Queues.
Ann. Oper. Res., 2002

2001
Inversion of Analytic Matrix Functions That are Singular at the Origin.
SIAM J. Matrix Anal. Appl., 2001

Homogeneous Customers Renege from Invisible Queues at Random Times under Deteriorating Waiting Conditions.
Queueing Syst. Theory Appl., 2001

The Aumann-Shapley price mechanism for allocating congestion costs.
Oper. Res. Lett., 2001

1999
On censored Markov chains, best augmentations and aggregation/disaggregation procedures.
Comput. Oper. Res., 1999

1997
Equilibrium Threshold Strategies: The Case of Queues with Priorities.
Oper. Res., 1997

1996
On constrained Markov decision processes.
Oper. Res. Lett., 1996

1995
Equilibrium strategies for queues with impatient customers.
Oper. Res. Lett., 1995

1993
On Series Expansions and Stochastic Matrices.
SIAM J. Matrix Anal. Appl., July, 1993

1992
Mean Passage Times and Nearly Uncoupled Markov Chains.
SIAM J. Discret. Math., 1992

Estimating the value of a discounted reward process.
Oper. Res. Lett., 1992

1990
Reneging from Processor Sharing Systems and Random Queues.
Math. Oper. Res., 1990


  Loading...