Succinct Approximation of Trade-Off Curves

  • Mihalis Yannakakis
Conference paper

DOI: 10.1007/11944874_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4286)
Cite this paper as:
Yannakakis M. (2006) Succinct Approximation of Trade-Off Curves. In: Spirakis P., Mavronicolas M., Kontogiannis S. (eds) Internet and Network Economics. WINE 2006. Lecture Notes in Computer Science, vol 4286. Springer, Berlin, Heidelberg

Abstract

When evaluating different solutions from a design space, it is often the case that more than one criteria come into play. The trade-off between the different criteria is captured by the so-called Pareto curve. The Pareto curve has typically an exponential number of points. However, it turns out that, under general conditions, there is a polynomially succinct curve that approximates the Pareto curve within any desired accuracy.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mihalis Yannakakis
    • 1
  1. 1.Department of Computer ScienceColumbia UniversityNew YorkUSA

Personalised recommendations