Randomized Strategies for Robust Combinatorial Optimization

05/20/2018
by   Yasushi Kawase, et al.
0

In this paper, we study the following robust optimization problem. Given an independence system and candidate objective functions, we choose an independent set, and then an adversary chooses one objective function, knowing our choice. Our goal is to find a randomized strategy (i.e., a probability distribution over the independent sets) that maximizes the expected objective value. To solve the problem, we propose two types of schemes for designing approximation algorithms. One scheme is for the case when objective functions are linear. It first finds an approximately optimal aggregated strategy and then retrieves a desired solution with little loss of the objective value. The approximation ratio depends on a relaxation of an independence system polytope. As applications, we provide approximation algorithms for a knapsack constraint or a matroid intersection by developing appropriate relaxations and retrievals. The other scheme is based on the multiplicative weights update method. A key technique is to introduce a new concept called (η,γ)-reductions for objective functions with parameters η, γ. We show that our scheme outputs a nearly α-approximate solution if there exists an α-approximation algorithm for a subproblem defined by (η,γ)-reductions. This improves approximation ratio in previous results. Using our result, we provide approximation algorithms when the objective functions are submodular or correspond to the cardinality robustness for the knapsack problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/17/2019

Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint

Submodular maximization with a cardinality constraint can model various ...
research
11/22/2017

Deterministic parallel algorithms for bilinear objective functions

Many randomized algorithms can be derandomized efficiently using either ...
research
06/25/2022

Solution and Fitness Evolution (SAFE): Coevolving Solutions and Their Objective Functions

We recently highlighted a fundamental problem recognized to confound alg...
research
11/02/2020

Unified greedy approximability beyond submodular maximization

We consider classes of objective functions of cardinality constrained ma...
research
07/15/2019

Some Black-box Reductions for Objective-robust Discrete Optimization Problems Based on their LP-Relaxations

We consider robust discrete minimization problems where uncertainty is d...
research
02/21/2019

The Markovian Price of Information

Suppose there are n Markov chains and we need to pay a per-step price to...
research
03/27/2023

Randomized rounding algorithms for large scale unsplittable flow problems

Unsplittable flow problems cover a wide range of telecommunication and t...

Please sign up or login with your details

Forgot password? Click here to reset