Maximizing expected utility over a knapsack constraint
نویسندگان
چکیده
منابع مشابه
Maximizing expected utility over a knapsack constraint
The expected utility knapsack problem is to pick a set of items whose values are described by random variables so as to maximize the expected utility of the total value of the items picked while satisfying a constraint on the total weight of items picked. We consider the following solution approach for this problem: (i) use the sample average approximation framework to approximate the stochasti...
متن کاملOnline Knapsack Problem under Expected Capacity Constraint
Online knapsack problem is considered, where items arrive in a sequential fashion that have two attributes; value and weight. Each arriving item has to be accepted or rejected on its arrival irrevocably. The objective is to maximize the sum of the value of the accepted items such that the sum of their weights is below a budget/capacity. Conventionally a hard budget/capacity constraint is consid...
متن کاملOptimal selection of uncertain actions by maximizing expected utility
A new means of action selection via utility fusion is introduced as an alternative to both sensor fusion and command fusion. Distributed asynchronous behaviors indicate the utility of various possible states and their associated uncertainty. A centralized arbiter then combines these utilities and probabilities to determine the optimal action based on the maximization of expected utility. The co...
متن کاملMaximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint
We consider the problem of maximizing a monotone submodular function under a knapsack constraint. We show that, for any fixed ǫ > 0, there exists a polynomial-time algorithm with an approximation ratio 1 − c/e − ǫ, where c ∈ [0, 1] is the (total) curvature of the input function. This approximation ratio is tight up to ǫ for any c ∈ [0, 1]. To the best of our knowledge, this is the first result ...
متن کاملQuantifying the Expected Utility of Communicating Constraint Information
In this paper we investigate methods for analyzing the expected value of communicating information in multi-agent planning and scheduling problems. As these problems are NPcomplete, no polynomial algorithms exist for evaluating the impact a certain constraint, or relaxing the same constraint, will have on the global problem. We present a general approach where distributed agents estimate their ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2016
ISSN: 0167-6377
DOI: 10.1016/j.orl.2015.12.016