 | 2008 |
|---|
| 12 |       | Moshe Haviv,
Jan van der Wal:
Mean sojourn times for phase-type discriminatory processor sharing systems.
European Journal of Operational Research 189(2): 375-386 (2008) |
| 2007 |
|---|
| 11 | | Moshe Haviv,
Tim Roughgarden:
The price of anarchy in an exponential multi-server.
Oper. Res. Lett. 35(4): 421-426 (2007) |
| 10 | | Moshe Haviv,
Jan van der Wal:
Waiting times in queues with relative priorities.
Oper. Res. Lett. 35(5): 591-594 (2007) |
| 9 | | Shoshana Anily,
Moshe Haviv:
The Cost Allocation Problem for the First Order Interaction Joint Replenishment Model.
Operations Research 55(2): 292-302 (2007) |
| 8 | | Moshe Haviv,
Yoav Kerner:
On balking from an empty queue.
Queueing Syst. 55(4): 239-249 (2007) |
| 2006 |
|---|
| 7 | | Refael Hassin,
Moshe Haviv:
Who should be given priority in a queue?
Oper. Res. Lett. 34(2): 191-198 (2006) |
| 2003 |
|---|
| 6 | | Mor Armony,
Moshe Haviv:
Price and delay competition between two service providers.
European Journal of Operational Research 147(1): 32-50 (2003) |
| 2002 |
|---|
| 5 | | Refael Hassin,
Moshe Haviv:
Nash Equilibrium and Subgame Perfection in Observable Queues.
Annals OR 113(1-4): 15-26 (2002) |
| 2001 |
|---|
| 4 | | Moshe Haviv:
The Aumann-Shapley price mechanism for allocating congestion costs.
Oper. Res. Lett. 29(5): 211-215 (2001) |
| 3 |  | Moshe Haviv,
Yaacov Ritov:
Homogeneous Customers Renege from Invisible Queues at Random Times under Deteriorating Waiting Conditions.
Queueing Syst. 38(4): 495-508 (2001) |
| 1999 |
|---|
| 2 | | Moshe Haviv:
On censored Markov chains, best augmentations and aggregation/disaggregation procedures.
Computers & OR 26(10-11): 1125-1132 (1999) |
| 1992 |
|---|
| 1 | | Refael Hassin,
Moshe Haviv:
Mean Passage Times and Nearly Uncoupled Markov Chains.
SIAM J. Discrete Math. 5(3): 386-397 (1992) |
