default search action
Moshe Haviv
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j47]Tzvi Alon
, Moshe Haviv:
Choosing a batch to be processed. Ann. Oper. Res. 326(1): 67-87 (2023) - [j46]Refael Hassin, Moshe Haviv, Binyamin Oz
Strategic behavior in queues with arrival rate uncertainty. Eur. J. Oper. Res. 309(1): 217-224 (2023) - [j45]Pengfei Guo
Signaling Service Quality Through Queue Disclosure. Manuf. Serv. Oper. Manag. 25(2): 543-562 (2023) - 2022
- [j44]Tzvi Alon
Discrete-time strategic job arrivals to a single machine with waiting and lateness penalties. Eur. J. Oper. Res. 303(1): 480-486 (2022) - [j43]Nimrod Dvir, Refael Hassin, Moshe Haviv:
On equilibrium threshold strategies when choosing between observable and unobservable queues. Oper. Res. Lett. 50(5): 555-560 (2022) - [j42]Moshe Haviv:
Optimal timing of arrival to a queue. Queueing Syst. Theory Appl. 100(3-4): 433-435 (2022) - 2021
- [j41]Moshe Haviv, Binyamin Oz
A busy period approach to some queueing games. Queueing Syst. Theory Appl. 97(3-4): 261-277 (2021) - [j40]Moshe Haviv, Liron Ravner
A survey of queueing systems with strategic timing of arrivals. Queueing Syst. Theory Appl. 99(1-2): 163-198 (2021) - 2020
- [j39]Tzvi Alon, Moshe Haviv:
Pooling Risk Games. IGTR 22(3): 1950015:1-1950015:28 (2020) - [j38]Moshe Haviv, Eyal Winter:
An optimal mechanism charging for priority in a queue. Oper. Res. Lett. 48(3): 304-308 (2020) - [i4]Moshe Haviv, Eyal Winter:
An optimal mechanism charging for priority in a queue. CoRR abs/2002.06533 (2020) - [i3]Moshe Haviv, Liron Ravner:
A survey of queueing systems with strategic timing of arrivals. CoRR abs/2006.12053 (2020)
2010 – 2019
- 2019
- [j37]Binyamin Oz
The Mn/Gn/1 queue with vacations and exhaustive service. Eur. J. Oper. Res. 277(3): 945-952 (2019) - [j36]Raneetha Abeywickrama, Moshe Haviv, Binyamin Oz
Strategic bidding in a discrete accumulating priority queue. Oper. Res. Lett. 47(3): 162-167 (2019) - 2018
- [j35]Dan Bendel, Moshe Haviv:
Cooperation and sharing costs in a tandem queueing network. Eur. J. Oper. Res. 271(3): 926-933 (2018) - [j34]Moshe Haviv, Binyamin Oz:
Self-Regulation of an Unobservable Queue. Manag. Sci. 64(5): 2380-2389 (2018) - 2017
- [j33]Binyamin Oz, Moshe Haviv, Martin L. Puterman:
The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers. Oper. Res. Lett. 45(5): 498-502 (2017) - [j32]Binyamin Oz
A rate balance principle and its application to queueing models. Queueing Syst. Theory Appl. 87(1-2): 95-111 (2017) - 2016
- [j31]Moshe Haviv, Liron Ravner
Strategic bidding in an accumulating priority queue: equilibrium analysis. Ann. Oper. Res. 244(2): 505-523 (2016) - [j30]Liron Ravner
A strategic timing of arrivals to a linear slowdown processor sharing system. Eur. J. Oper. Res. 255(2): 496-504 (2016) - [j29]Moshe Haviv, Binyamin Oz
Regulating an observable M/M/1 queue. Oper. Res. Lett. 44(2): 196-198 (2016) - [j28]Moshe Haviv:
The performance of a single-server queue with preemptive random priorities. Perform. Evaluation 103: 60-68 (2016) - 2015
- [j27]Moshe Haviv, Liron Ravner
Strategic timing of arrivals to a finite queue multi-server loss system. Queueing Syst. Theory Appl. 81(1): 71-96 (2015) - [e1]Moshe Haviv, William J. Knottenbelt, Lorenzo Maggi, Daniele Miorandi:
8th International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2014, Bratislava, Slovakia, December 9-11, 2014. ICST 2015, ISBN 978-1-63190-057-0 [contents] - [i2]Liron Ravner, Moshe Haviv, Hai Le Vu:
A strategic timing of arrivals to a linear slowdown processor sharing system. CoRR abs/1508.03420 (2015) - [i1]Moshe Haviv, Liron Ravner:
Strategic Bidding in an Accumulating Priority Queue: Equilibrium Analysis. CoRR abs/1510.03575 (2015) - 2014
- [j26]Shoshana Anily, Moshe Haviv:
Subadditive and Homogeneous of Degree One Games Are Totally Balanced. Oper. Res. 62(4): 788-793 (2014) - [j25]Moshe Haviv, Ramandeep S. Randhawa:
Pricing in Queues Without Demand Information. Manuf. Serv. Oper. Manag. 16(3): 401-411 (2014) - [j24]Moshe Haviv:
Regulating an M/G/1 queue when customers know their demand. Perform. Evaluation 77: 57-71 (2014) - [c4]Liron Ravner, Moshe Haviv:
Equilibrium and socially optimal arrivals to a single server loss system. NetGCooP 2014: 119-126 - [c3]Binyamin Oz, Moshe Haviv, Martin L. Puterman:
Self and social optimization in multi-class multi-server queueing systems with relative priorities. NetGCooP 2014: 135-141 - [c2]Moshe Haviv:
The M/G/1 queueing model with preemptive random priorities. VALUETOOLS 2014 - 2013
- [j23]Moshe Haviv:
When to arrive at a queue with tardiness costs? Perform. Evaluation 70(6): 387-399 (2013) - 2011
- [j22]Moshe Haviv, Yoav Kerner:
The age of the arrival process in the G/M/1 and M/G/1 queues. Math. Methods Oper. Res. 73(1): 139-152 (2011) - [j21]Moshe Haviv, Rita Zlotnikov:
Computational schemes for two exponential servers where the first has a finite buffer. RAIRO Oper. Res. 45(1): 17-36 (2011) - 2010
- [j20]Shoshana Anily, Moshe Haviv:
Cooperation in Service Systems. Oper. Res. 58(3): 660-673 (2010)
2000 – 2009
- 2009
- [c1]Eitan Altman, Moshe Haviv:
Broadcasting forever. GAMENETS 2009: 484-487 - 2008
- [j19]Moshe Haviv, Jan van der Wal:
Mean sojourn times for phase-type discriminatory processor sharing systems. Eur. J. Oper. Res. 189(2): 375-386 (2008) - 2007
- [j18]Shoshana Anily, Moshe Haviv:
The Cost Allocation Problem for the First Order Interaction Joint Replenishment Model. Oper. Res. 55(2): 292-302 (2007) - [j17]Moshe Haviv, Tim Roughgarden:
The price of anarchy in an exponential multi-server. Oper. Res. Lett. 35(4): 421-426 (2007) - [j16]Moshe Haviv, Jan van der Wal:
Waiting times in queues with relative priorities. Oper. Res. Lett. 35(5): 591-594 (2007) - [j15]Moshe Haviv, Yoav Kerner:
On balking from an empty queue. Queueing Syst. Theory Appl. 55(4): 239-249 (2007) - 2006
- [j14]Refael Hassin, Moshe Haviv:
Who should be given priority in a queue? Oper. Res. Lett. 34(2): 191-198 (2006) - 2003
- [j13]Mor Armony, Moshe Haviv:
Price and delay competition between two service providers. Eur. J. Oper. Res. 147(1): 32-50 (2003) - 2002
- [j12]Refael Hassin, Moshe Haviv:
Nash Equilibrium and Subgame Perfection in Observable Queues. Ann. Oper. Res. 113(1-4): 15-26 (2002) - 2001
- [j11]Moshe Haviv:
The Aumann-Shapley price mechanism for allocating congestion costs. Oper. Res. Lett. 29(5): 211-215 (2001) - [j10]Moshe Haviv, Yaacov Ritov:
Homogeneous Customers Renege from Invisible Queues at Random Times under Deteriorating Waiting Conditions. Queueing Syst. Theory Appl. 38(4): 495-508 (2001) - [j9]Konstantin Avrachenkov
Inversion of Analytic Matrix Functions That are Singular at the Origin. SIAM J. Matrix Anal. Appl. 22(4): 1175-1189 (2001)
1990 – 1999
- 1999
- [j8]Moshe Haviv:
On censored Markov chains, best augmentations and aggregation/disaggregation procedures. Comput. Oper. Res. 26(10-11): 1125-1132 (1999) - 1997
- [j7]Refael Hassin, Moshe Haviv:
Equilibrium Threshold Strategies: The Case of Queues with Priorities. Oper. Res. 45(6): 966-973 (1997) - 1996
- [j6]Moshe Haviv:
On constrained Markov decision processes. Oper. Res. Lett. 19(1): 25-28 (1996) - 1995
- [j5]Refael Hassin, Moshe Haviv:
Equilibrium strategies for queues with impatient customers. Oper. Res. Lett. 17(1): 41-45 (1995) - 1993
- [j4]Moshe Haviv, Yaacov Ritov:
On Series Expansions and Stochastic Matrices. SIAM J. Matrix Anal. Appl. 14(3): 670-676 (1993) - 1992
- [j3]Moshe Haviv, Martin L. Puterman:
Estimating the value of a discounted reward process. Oper. Res. Lett. 11(5): 267-272 (1992) - [j2]Refael Hassin, Moshe Haviv:
Mean Passage Times and Nearly Uncoupled Markov Chains. SIAM J. Discret. Math. 5(3): 386-397 (1992) - 1990
- [j1]David Assaf, Moshe Haviv:
Reneging from Processor Sharing Systems and Random Queues. Math. Oper. Res. 15(1): 129-138 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: