The preservation of likelihood ratio ordering under convolution
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Yinbo Feng & Ming Hu, 2017. "Blockbuster or Niche? Competitive Strategy under Network Effects," Working Papers 17-13, NET Institute.
- Shaked, Moshe & George Shanthikumar, J., 1995. "Hazard rate ordering of k-out-of-n systems," Statistics & Probability Letters, Elsevier, vol. 23(1), pages 1-8, April.
- Nanda, Asok K. & Das, Suchismita, 2012. "Stochastic orders of the Marshall–Olkin extended distribution," Statistics & Probability Letters, Elsevier, vol. 82(2), pages 295-302.
- Taizhong Hu & Asok K. Nanda & Huiliang Xie & Zegang Zhu, 2004. "Properties of some stochastic orders: A unified study," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(2), pages 193-216, March.
- Lillo, Rosa E. & Nanda, Asok K. & Shaked, Moshe, 2001. "Preservation of some likelihood ratio stochastic orders by order statistics," Statistics & Probability Letters, Elsevier, vol. 51(2), pages 111-119, January.
- Félix Belzunce & Moshe Shaked, 2004. "Failure profiles of coherent systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(4), pages 477-490, June.
- Belzunce, Félix & Ruiz, José M. & Shaked, Moshe, 2000. "Stochastic comparisons of nonhomogeneous processes," DES - Working Papers. Statistics and Econometrics. WS 9866, Universidad Carlos III de Madrid. Departamento de EstadÃstica.
- Hu, Taizhong & Zhu, Zegang, 2001. "An analytic proof of the preservation of the up-shifted likelihood ratio order under convolutions," Stochastic Processes and their Applications, Elsevier, vol. 95(1), pages 55-61, September.
- Xiuli Chao & Carlton Scott, 2000. "Several Results on the Design of Queueing Systems," Operations Research, INFORMS, vol. 48(6), pages 965-970, December.
- Daduna, Hans & Szekli, Ryszard, 1996. "A queueing theoretical proof of increasing property of Polya frequency functions," Statistics & Probability Letters, Elsevier, vol. 26(3), pages 233-242, February.
- Sonja Otten & Ruslan Krenzler & Lin Xie & Hans Daduna & Karsten Kruse, 2022. "Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 603-648, June.
More about this item
Keywords
shifted likelihood ratio ordering * log-concavity * queueing networks * total positivity * conditional stochastic order;Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:23:y:1986:i:2:p:259-267. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.