Moshe Haviv

According to our database1, Moshe Haviv authored at least 37 papers between 1990 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Self-Regulation of an Unobservable Queue.
Management Science, 2018

Cooperation and sharing costs in a tandem queueing network.
European Journal of Operational Research, 2018

2017
A rate balance principle and its application to queueing models.
Queueing Syst., 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. Eval., 2016

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

A strategic timing of arrivals to a linear slowdown processor sharing system.
European Journal of Operational Research, 2016

Strategic bidding in an accumulating priority queue: equilibrium analysis.
Annals OR, 2016

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

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

Pricing in Queues Without Demand Information.
Manufacturing & Service Operations Management, 2014

Subadditive and Homogeneous of Degree One Games Are Totally Balanced.
Operations Research, 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. Eval., 2013

2011
Computational schemes for two exponential servers where the first has a finite buffer.
RAIRO - Operations Research, 2011

The age of the arrival process in the G/M/1 and M/G/1 queues.
Math. Meth. of OR, 2011

2010
Cooperation in Service Systems.
Operations Research, 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.
European Journal of Operational Research, 2008

2007
On balking from an empty queue.
Queueing Syst., 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.
Operations Research, 2007

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

2003
Price and delay competition between two service providers.
European Journal of Operational Research, 2003

2002
Nash Equilibrium and Subgame Perfection in Observable Queues.
Annals OR, 2002

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

Homogeneous Customers Renege from Invisible Queues at Random Times under Deteriorating Waiting Conditions.
Queueing Syst., 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.
Computers & OR, 1999

1997
Equilibrium Threshold Strategies: The Case of Queues with Priorities.
Operations Research, 1997

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

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

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

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


  Loading...