Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids
Abstract
We study the sensitivity of optimal solutions of convex separable optimization problems over an integral polymatroid base polytope with respect to parameters determining both the cost of each element and the polytope. Under convexity and a regularity assumption on the functional dependency of the cost function with respect to the parameters, we show that reoptimization after a change in parameters can be done by elementary local operations. Applying this result, we derive that starting from any optimal solution there is a new optimal solution to new parameters such that the L1-norm of the difference of the two solutions is at most two times the L1 norm of the difference of the parameters. We apply these sensitivity results to a class of non-cooperative polymatroid games and derive the existence of pure Nash equilibria. We complement our results by showing that polymatroids are the maximal combinatorial structure enabling these results. For any non-polymatroid region, there is a corresponding optimization problem for which the sensitivity results do not hold. In addition, there is a game where the players strategies are isomorphic to the non-polymatroid region and that does not admit a pure Nash equilibrium.
Cite
@article{arxiv.1611.05372,
title = {Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids},
author = {Tobias Harks and Max Klimm and Britta Peis},
journal= {arXiv preprint arXiv:1611.05372},
year = {2016}
}
Comments
Succeeds arXiv paper 1407.7650. arXiv admin note: text overlap with arXiv:1407.7650