Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
Sudipto Guha,Kamesh Munagala +1 more
Reads0
Chats0
TLDR
In this paper, the authors show that while probing yields significant improvement in the objective function, being adaptive about the probing is not beneficial beyond constant factors, whereas non-adaptive observations can be performed in parallel.Abstract:
In several applications such as databases, planning, and sensor networks, parameters such as selectivity, load, or sensed values are known only with some associated uncertainty. The performance of such a system (as captured by some objective function over the parameters) is significantly improved if some of these parameters can be probed or observed. In a resource constrained situation, deciding which parameters to observe in order to optimize system performance, itself becomes an interesting and important optimization problem. This general problem is the focus of this article.One of the most important considerations in this framework is whether adaptivity is required for the observations. Adaptive observations introduce blocking or sequential operations in the system whereas nonadaptive observations can be performed in parallel. One of the important questions in this regard is to characterize the benefit of adaptivity for probes and observation.We present general techniques for designing constant factor approximations to the optimal observation schemes for several widely used scheduling and metric objective functions. We show a unifying technique that relates this optimization problem to the outlier version of the corresponding deterministic optimization. By making this connection, our technique shows constant factor upper bounds for the benefit of adaptivity of the observation schemes. We show that while probing yields significant improvement in the objective function, being adaptive about the probing is not beneficial beyond constant factors.read more
Citations
More filters
Proceedings ArticleDOI
Algorithms and adaptivity gaps for stochastic probing
TL;DR: The first approximation algorithms for a number of stochastic probing problems, which have applications, e.g., to path-planning and precedence-constrained scheduling, are obtained.
Book ChapterDOI
Selective call out and real time bidding
TL;DR: This paper models this selective call out as an online recurrent Bayesian decision framework with bandwidth type constraints, and obtains natural algorithms with bounded performance guarantees for several natural optimization criteria.
Journal ArticleDOI
The Price of Anarchy in Network Creation Games Is (Mostly) Constant
TL;DR: The two main results of the paper show that for α>273⋅n all equilibria in SumGame are trees and thus the price of anarchy is constant, and that forα>129 all equibria in MaxGame are Trees and the price is constant.
Journal ArticleDOI
A new approximation technique for resource‐allocation problems
Barna Saha,Aravind Srinivasan +1 more
TL;DR: A rounding method based on random walks in polytopes is developed, which leads to improved approximation algorithms and integrality gaps for several assignment problems that arise in resource allocation and scheduling.
Journal ArticleDOI
Strategies for Ensuring Required Service Level for COVID-19 Herd Immunity in Indian Vaccine Supply Chain.
TL;DR: In this paper, the authors developed a model to identify critical nodes in the supply chain of COVID-19 vaccine distribution in order to ensure a minimum service level (67%) under the possibility of lead time disruptions.
References
More filters
Proceedings ArticleDOI
Boosted sampling: approximation algorithms for stochastic optimization
TL;DR: This framework is used to derive constant factor approximations for stochastic versions of Vertex Cover, Steiner Tree and Uncapacitated Facility Location for arbitrary distributions π in one fell swoop.
Proceedings ArticleDOI
On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems
TL;DR: This work considers a number of combinatorial optimization problems in which the problem instance is uncertain---modeled by a probability distribution---and in which solution elements can be purchased cheaply now or at greater expense after the distribution is sampled.
Journal ArticleDOI
Allocating Bandwidth for Bursty Connections
TL;DR: This paper undertake the first study of statistical multiplexing from the perspective of approximation algorithms, and considers one of the most commonly studied models: that of two communicating nodes connected by a set of parallel edges, where the rate of each connection between them is a random variable.
Proceedings ArticleDOI
Adaptivity and approximation for stochastic packing problems
TL;DR: The adaptivity gap is investigated for these problems: the maximum ratio between the expected values achieved by optimal adaptive and non-adaptive policies, and the hardness results for deterministic PIP are improved.
Journal ArticleDOI
An approximation scheme for stochastic linear programming and its application to stochastic integer programs
David B. Shmoys,Chaitanya Swamy +1 more
TL;DR: It is shown that for a broad class of 2-stage linear models with recourse, one can, for any ε > 0, in time polynomial in 1/ε and the size of the input, compute a solution of value within a factor of the optimum, in spite of the fact that exponentially many second-stage scenarios may occur.