increasing convex ordering
Recently Published Documents


TOTAL DOCUMENTS

12
(FIVE YEARS 0)

H-INDEX

4
(FIVE YEARS 0)

2018 ◽  
Vol 48 (12) ◽  
pp. 2904-2916
Author(s):  
T. H. M. Abouelmagd ◽  
A. A. E. Ahmed ◽  
Enayat M. Abd Elrazik ◽  
Mahmoud M. Mansour ◽  
A-Hadi N. Ahmed ◽  
...  

2017 ◽  
Vol 5 (1) ◽  
pp. 145-153 ◽  
Author(s):  
Xiaoqing Pan ◽  
Xiaohu Li

AbstractThis paper studies the increasing convex ordering of the optimal discounted capital allocations for stochastic arrangement increasing risks with stochastic arrangement decreasing occurrence times. The application to optimal allocation of policy limits is presented as an illustration as well.


2006 ◽  
Vol 136 (3) ◽  
pp. 555-569 ◽  
Author(s):  
I.A. Ahmad ◽  
A. Ahmed ◽  
I. Elbatal ◽  
M. Kayid

1995 ◽  
Vol 9 (2) ◽  
pp. 239-254 ◽  
Author(s):  
S. C. Borst

We study a globally gated polling system with a dormant server, which makes a halt at its home base when there are no customers present in the system. We derive an explicit expression for the cycle time distribution as well as for the waiting-time distribution at each of the queues. As a justification of the dormant server policy, we show the waiting time at each of the queues to be smaller (in the increasing-convex-ordering sense) than in the ordinary nondormant server case.


1994 ◽  
Vol 31 (3) ◽  
pp. 834-840 ◽  
Author(s):  
Armand M. Makowski

In this short note, we present a simple characterization of the increasing convex ordering on the set of probability distributions on ℝ. We show its usefulness by providing a very short proof of a comparison result for M/GI/1 queues due to Daley and Rolski, and obtained by completely different means.


1994 ◽  
Vol 31 (03) ◽  
pp. 834-840
Author(s):  
Armand M. Makowski

In this short note, we present a simple characterization of the increasing convex ordering on the set of probability distributions on ℝ. We show its usefulness by providing a very short proof of a comparison result for M/GI/1 queues due to Daley and Rolski, and obtained by completely different means.


1994 ◽  
Vol 31 (2) ◽  
pp. 466-475 ◽  
Author(s):  
Zhen Liu ◽  
Don Towsley

In this paper we consider the problem of routing customers to identical servers, each with its own infinite-capacity queue. Under the assumptions that (i) the service times form a sequence of independent and identically distributed random variables with increasing failure rate distribution and (ii) state information is not available, we establish that the round-robin policy minimizes, in the sense of a separable increasing convex ordering, the customer response times and the numbers of customers in the queues.


1994 ◽  
Vol 31 (02) ◽  
pp. 466-475 ◽  
Author(s):  
Zhen Liu ◽  
Don Towsley

In this paper we consider the problem of routing customers to identical servers, each with its own infinite-capacity queue. Under the assumptions that (i) the service times form a sequence of independent and identically distributed random variables with increasing failure rate distribution and (ii) state information is not available, we establish that the round-robin policy minimizes, in the sense of a separable increasing convex ordering, the customer response times and the numbers of customers in the queues.


Sign in / Sign up

Export Citation Format

Share Document