Decision Making Based on Approximate and Smoothed Pareto Curves
We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the so-called decision maker’s approach in which both criteria are combined into a single (usually non-linear) objective function. Previous work by Papadimitriou and Yannakakis showed how to efficiently approximate the Pareto curve for problems like Shortest Path, Spanning Tree, and Perfect Matching. We wish to determine for which classes of combined objective functions the approximate Pareto curve also yields an approximate solution to the decision maker’s problem. We show that an FPTAS for the Pareto curve also gives an FPTAS for the decision maker’s problem if the combined objective function is growth bounded like a quasi-polynomial function. If these functions, however, show exponential growth then the decision maker’s problem is NP-hard to approximate within any factor. In order to bypass these limitations of approximate decision making, we turn our attention to Pareto curves in the probabilistic framework of smoothed analysis. We show that in a smoothed model, we can efficiently generate the (complete and exact) Pareto curve with a small failure probability if there exists an algorithm for generating the Pareto curve whose worst case running time is pseudopolynomial. This way, we can solve the decision maker’s problem w.r.t. any non-decreasing objective function for randomly perturbed instances of, e.g., Shortest Path, Spanning Tree, and Perfect Matching.
KeywordsPareto Optimal Solution Short Path Problem Span Tree Problem Pareto Curve Combine Objective Function
Unable to display preview. Download preview PDF.
- 1.Agarwal, P.K., Eppstein, D., Guibas, L.J., Henzinger, M.R.: Parametric and kinetic minimum spanning trees. In: IEEE Symposium on Foundations of Computer Science, pp. 596–605 (1998)Google Scholar
- 4.Beier, R., Vöcking, B.: Typical Properties of Winners and Losers in Discrete Optimization. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC-2004), pp. 343–352 (2004)Google Scholar
- 5.Dey, T.K.: Improved bounds on planar k-sets and k-levels. In: IEEE Symposium on Foundations of Computer Science, pp. 161–165 (1997)Google Scholar
- 7.Hansen, P.: Bicriterion path problems. In: Programming Languages and their Definition. Lecture Notes in Economics and Mathematical Systems, vol. 177, pp. 109–127 (1980)Google Scholar
- 10.Katoh, N.: Bicriteria network optimization problems. IEICE Transactions Fundamentals of Electronics, Communications and Computer Sciences E75-A, 321–329 (1992)Google Scholar