136 research outputs found
Randomized Strategies for Robust Combinatorial Optimization
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
Wiretapping a hidden network
We consider the problem of maximizing the probability of hitting a
strategically chosen hidden virtual network by placing a wiretap on a single
link of a communication network. This can be seen as a two-player win-lose
(zero-sum) game that we call the wiretap game. The value of this game is the
greatest probability that the wiretapper can secure for hitting the virtual
network. The value is shown to equal the reciprocal of the strength of the
underlying graph.
We efficiently compute a unique partition of the edges of the graph, called
the prime-partition, and find the set of pure strategies of the hider that are
best responses against every maxmin strategy of the wiretapper. Using these
special pure strategies of the hider, which we call
omni-connected-spanning-subgraphs, we define a partial order on the elements of
the prime-partition. From the partial order, we obtain a linear number of
simple two-variable inequalities that define the maxmin-polytope, and a
characterization of its extreme points.
Our definition of the partial order allows us to find all equilibrium
strategies of the wiretapper that minimize the number of pure best responses of
the hider. Among these strategies, we efficiently compute the unique strategy
that maximizes the least punishment that the hider incurs for playing a pure
strategy that is not a best response. Finally, we show that this unique
strategy is the nucleolus of the recently studied simple cooperative spanning
connectivity game
Combinatorial Optimization
Combinatorial Optimization is a very active field that benefits from bringing together ideas from different areas, e.g., graph theory and combinatorics, matroids and submodularity, connectivity and network flows, approximation algorithms and mathematical programming, discrete and computational geometry, discrete and continuous problems, algebraic and geometric methods, and applications. We continued the long tradition of triannual Oberwolfach workshops, bringing together the best researchers from the above areas, discovering new connections, and establishing new and deepening existing international collaborations
Dagstuhl News January - December 2002
"Dagstuhl News" is a publication edited especially for the members of the Foundation "Informatikzentrum Schloss Dagstuhl" to thank them for their support. The News give a summary of the scientific work being done in Dagstuhl. Each Dagstuhl Seminar is presented by a small abstract describing the contents and scientific highlights of the seminar as well as the perspectives or challenges of the research topic
- …