Resource Allocation Problems with Concave Reward Functions

Efficient Resource Allocation with Non-Concave Objective Functions

We consider resource allocation with separable objective functions defined over subranges of the integers. While it is well known that (the maximization version of) this problem can be solved efficiently if the objective functions are concave, the general problem of resource allocation with non-concave functions is difficult. In this article we show that for fairly well-shaped non-concave objec...

Resource Allocation Problems with Cost Functions

We study the complexity of a multilateral negotiation framework in which autonomous agents agree in pairs to exchange resources in order to minimise their individual cost. We are interested in establishing whether an allocation of resources that minimises total cost can be reached from an initial allocation in which one agent holds all the resources and one resource is transferred in each contr...

Asymptotic Behavior of Multivariate Reward Processes with Nonlinear Reward Functions

COVARIANCE MATRIX OF MULTIVARIATE REWARD PROCESSES WITH NONLINEAR REWARD FUNCTIONS

Multivariate reward processes with reward functions of constant rates, defined on a semi-Markov process, first were studied by Masuda and Sumita, 1991. Reward processes with nonlinear reward functions were introduced in Soltani, 1996. In this work we study a multivariate process , , where are reward processes with nonlinear reward functions respectively. The Laplace transform of the covar...

Online Resource Allocation Problems∗

In this paper, we consider an online resource allocation problem, where buyers with limited budgets are interested in purchasing items that consume a limited amount of resources. In general, there is no nontrivial performance guarantee for the worst cases. However, after imposing two reasonable restrictions, we can propose two online algorithms, a greedy algorithm and a primal dual algorithm, w...