We consider multiarmed bandit problems with switching cost, define uniformly good allocation rules, and restrict attention to such rules. We present a lower bound on the asymptotic performance of uniformly good allocation rules and construct an allocation scheme that achieves the bound. We discover that despite the inclusion of a switching cost the proposed allocation scheme achieves the same a...

We treat the problem of optimally allocating a single resource under uncertainty to the various activities of a project to minimize a certain economic objective composed of resource utilization cost and tardiness cost. Traditional project scheduling methods assume that the uncertainty resides in the duration of the activities. Our research differs from the traditional view in that it assumes th...

We present a model of optimal allocation of resources to reproduction and growth in a simple multicellular organism with limited lifespan, using a gene network formalism to simulate gene interactions within cells. The model is compatible with more conventional approaches to allocation problems in life history and in addition provides connections between processes at the gene and cell levels on ...

In this paper, we study allocation problems and other related problems where a discrete estate should be divided among agents who have claims on it. We characterize the set of rules satisfying additivity on the estate along with additivity on the estate and the claims. These results complete the characterizations given by Bergantiños and Vidal-Puga (Mathematical Social Sciences) in the continuo...

The nucleon is introduced as a new allocation concept for non-negative cooperative n-person transferable utility games. The nucleon may be viewed as the multiplicative analogue of Schmeidler's nucleolus. It is shown that the nucleon of (not necessarily bipartite) matching games can be computed in polynomial time. 9 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

We deal with the rate allocation problem for downlink in a Multi-hop Cellular Network. A mathematical model is provided to assign transmission rates in order to reach an optimal and fair solution. We prove that under some conditions that are often met, the problem can be reduced to a single-hop cellular network problem. The validity of our proof is confirmed experimentally.

The strengths and weaknesses of agent-based approaches and mathematical optimization techniques are analyzed and compared. Their appropriateness for dynamic distributed resource allocation is evaluated. We conclude that their properties are complementary and that it seems fruitful to try to combine the approaches. Some suggestions of such hybrid systems are sketched.

Freight transportation is characterized by highly dynamic information processes: customers call in orders over time to move freight; the movement of freight over long distances is subject to random delays; equipment failures require last minute changes; and decisions are not always executed in the field according to plan. The highdimensionality of the decisions involved has made transportation ...

Shelf on which products are being displayed is one of the most important resources in retail environment. Retailers cannot only increase their profit but also decrease cost by proper management of shelf space allocation and products display. This paper addresses a problem of retailer who sells various brands of items through displaying on multi-level shelves. It is assumed that the level of she...

The tolerance allocation problem has been studied in the literature for decades, usually using mathematical programming (or) heuristic optimization approaches. Elegant tools for minimum cost tolerance allocation have been developed over several decades but still there is no specified tool to find the total cost with respect to machining cost and asymmetric quality loss functions. Objective of t...