The Price of Information in Combinatorial Optimization

  title={The Price of Information in Combinatorial Optimization},
  author={Sahil Singla},
  • Sahil Singla
  • Published in SODA 1 November 2017
  • Computer Science
Consider a network design application where we wish to lay down a minimum-cost spanning tree in a given graph; however, we only have stochastic information about the edge costs. To learn the precise cost of any edge, we have to conduct a study that incurs a price. Our goal is to find a spanning tree while minimizing the disutility, which is the sum of the tree cost and the total price that we spend on the studies. In a different application, each edge gives a stochastic reward value. Our goal… 

Combinatorial Optimization Under Uncertainty ( Probing and Stopping-Time Algorithms )

This thesis studies models where the input is revealed to us element-by-element and the authors have to make irrevocable decisions and considers combinatorial problems when either they have stochastic knowledge about the input but the revelation order is chosen by an adversary or when there are probing constraints.

Beating Greedy for Stochastic Bipartite Matching

A linear program (LP) is used to upper bound the optimum achieved by any strategy in the maximum bipartite matching problem in stochastic settings, namely the query-commit and price-of-information models.

Markov Game with Switching Costs

This paper shows there is a simple index strategy that achieves a constant approximation factor if the switching cost is constant and k = 1, and proposes a more involved constant-factor approximation algorithm, via an nontrivial reduction to the stochastic k-TSP problem, in which a Markov chain is approximated by a random variable.

The Markovian Price of Information

This paper proposes a strategy for advancing the Markov chains if the goal is to maximize the total reward minus the total price that the authors pay.

Multi-token Markov Game with Switching Costs

There is a simple index strategy that achieves a constant approximation factor if the switching cost is constant and k = 1 for a general Markovian MAB variant with switching costs, and this index strategy is the best of the knowledge.

Online Allocation and Pricing: Constant Regret via Bellman Inequalities

This work develops a framework for designing simple and efficient policies for a family of online allocation and pricing problems that includes online packing, budget-constrained probing, dynamic pricing, and online contextual bandits with knapsacks, based on Bellman inequalities.

Pandora's Box Problem with Order Constraints

It is proved that finding approximately optimal adaptive search strategies is NP-hard when certain matroid constraints are used to further restrict the set of boxes which may be opened, or when the order constraints are given as reachability constraints on a DAG.

Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications

These results are the first non-trivial results for random order prophet matching and Price-of-Information matching in general graphs.

Decentralized Matching in a Probabilistic Environment

This work considers a model for repeated stochastic matching where compatibility is probabilistic, is realized the first time agents are matched, and persists in the future, and demonstrates that the above process provides a 0.316-approximation to the optimal online algorithm for matching on general graphs.

Stochastic Monotone Submodular Maximization with Queries

It is proved that the problem admits a good query strategy if the feasible domain has a uniform exchange property, and generalizes Blum et al.'s result on the unweighted matching problem and Behnezhad and Reyhani's results on the weighted matching problem in both objective function and feasible domain.



Approximation algorithms for stochastic orienteering

A constant-factor approximation algorithm for the best non-adaptive policy for the Stochastic Orienteering problem and shows a small adaptivity gap, and addresses the case when the node rewards are also random and could be correlated with the waiting time.

Query Strategies for Priced Information

This work considers a class of problems in which an algorithm seeks to compute a function f over a set of n inputs, where each input has an associated price and investigates a model for pricing that satisfies a very strong type of equilibrium property.

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings

A generalization of the stochastic online matching problem that also models preference-uncertainty and timeouts of buyers, and gives a constant factor approximation algorithm.

Selection with monotone comparison costs

This work considers the problem of selecting the rth-smallest element from a list of n elements under a model where the comparisons may have different costs depending on the elements being compared and presents an O(log2 n)-competitive algorithm for selection under the monotone cost model.

Improved Approximation Algorithms for Stochastic Matching

In this paper we consider the Stochastic Matching problem, which is motivated by applications in kidney exchange and online dating. We are given an undirected graph in which every edge is assigned a

Sorting and selection with structured costs

It is shown that it is possible to get much improved results with the structured cost model than the case when the authors do not have any assumptions on comparison costs, and most practical applications will have some structured cost property.

Stochastic combinatorial optimization via poisson approximation

The Poisson approximation technique is introduced, which enables us to approximate the distribution of the sum of a set of random variables using a compound Poisson distribution and can reduce a variety of stochastic problems to the corresponding deterministic multiple-objective problems.

Multi-armed Bandits with Metric Switching Costs

A general duality-based framework is developed to provide the first O (1) approximation for metric switching costs; the actual constants being quite small.

Approximating Matches Made in Heaven

A simple greedy strategy for selecting probes is given which produces a matching whose cardinality is, in expectation, at least a quarter of the size of this optimal algorithm's matching.