Explicit Solutions for a General Class of Optimal Allocation Problems

2013 ◽  
Author(s):  
Ka Chun Cheung ◽  
Jan Dhaene ◽  
Yian Vivian Rong ◽  
S. C. P. Yam
1994 ◽  
Vol 8 (1) ◽  
pp. 113-124 ◽  
Author(s):  
Haijun Li

Motivated by stochastic allocation problems, we study sufficient conditions that imply a general class of stochastic arrangement inequalities. This class includes many known and useful arrangement inequalities in the literature. Some illustrative examples in reliability theory are also given.


2018 ◽  
Vol 336 ◽  
pp. 394-407 ◽  
Author(s):  
Ka Chun Cheung ◽  
Jan Dhaene ◽  
Yian Rong ◽  
Sheung Chi Phillip Yam

1966 ◽  
Vol 3 (3) ◽  
pp. 261-268 ◽  
Author(s):  
Paul E. Green ◽  
Michael H. Halbert ◽  
Patrick J. Robinson

This article is concerned with the effect of a problem's environmental context on the learning of an “optimal” allocation rule. A series of sales allocation problems were presented to groups of executive and student subjects. While the allocation principle remained invariant over conditions, the context of the problem was experimentally modified. Results of the experiments indicated that: (1) both groups of subjects performed about the same; (2) the modifications made in the “surface” complexity of the problem did not markedly affect the probability of learning the allocation principle; and (3) a constant-probability-over-trials model appeared to describe learning behavior.


2009 ◽  
Vol 27 (2) ◽  
pp. 270-296 ◽  
Author(s):  
Miguel Martinez ◽  
Sylvain Rubenthaler ◽  
Etienne Tanré

Sign in / Sign up

Export Citation Format

Share Document