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
Improved Steiner tree approximation in graphs
TL;DR: A new polynomial-time heuristic with an approximation ratio approaching 1 + 1~___33 ~ 1.55, which improves upon the previously best-known approximation algorithm of [10] with performance ratio ~1.59.
Proceedings ArticleDOI
Improved combinatorial algorithms for the facility location and k-median problems
Moses Charikar,Sudipto Guha +1 more
TL;DR: Improved combinatorial approximation algorithms for the uncapacitated facility location and k-median problems and a 4-approximation for the k- median problem are presented, building on the 6- approximation of Jain and Vazirani.
Proceedings ArticleDOI
Algorithms for facility location problems with outliers
TL;DR: This paper explores a generalization of various facility location problems to the case when only a specified fraction of the customers are to be served, and provides generalizations of various approximation algorithms to deal with this added constraint.
Proceedings Article
Near-optimal nonmyopic value of information in graphical models
Andreas Krause,Carlos Guestrin +1 more
TL;DR: This work addresses the long standing problem of nonmyopically selecting the most informative subset of variables in a graphical model and presents the first efficient randomized algorithm providing a constant factor (1 - 1/e – e) approximation guarantee for any e > 0 with high confidence.
Posted Content
Near-optimal Nonmyopic Value of Information in Graphical Models
Andreas Krause,Carlos Guestrin +1 more
TL;DR: In this paper, the authors presented an efficient randomized algorithm providing a constant factor (1-1/e-epsilon) approximation guarantee for any epsilon > 0 with high confidence.