Advertisement

The New Faces of Combinatorial Optimization

  • Christos H. Papadimitriou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7422)

Abstract

I identify several important current variants on the theme of combinatorial optimization that constitute significant departures from the field’s research tradition: Multicriterion optimization, competitive equilibria, and optimizing with incentives. I also discuss the surprisingly weak connections between optimization and evolution (this latter topic was the subject of my ISCO talk).

Keywords

Genetic Algorithm Short Path Nash Equilibrium Local Search Combinatorial Optimization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barton, N.H., Charlesworth, B.: Why sex and recombination? Science 281, 1986–1990 (1998)CrossRefGoogle Scholar
  2. 2.
    Diakonikolas, I.: Approximation of Multiobjective Optimization Problems. PhD thesis (2010)Google Scholar
  3. 3.
    Diakonikolas, I., Yannakakis, M.: Succinct Approximate Convex Pareto Curves. In: SODA (2008)Google Scholar
  4. 4.
    Diakonikolas, I., Yannakakis, M.: Small approximate pareto sets for biobjective shortest paths and other problems. SIAM J. Comput. 39, 1340–1371 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: STOC 2004, pp. 604–612 (2004)Google Scholar
  6. 6.
    Livnat, A., Papadimitriou, C., Dushoff, J., Feldman, M.: A mixability theory of sex in evolution. In: PNAS (December 2008)Google Scholar
  7. 7.
    Livnat, A., Papadimitriou, C., Feldman, M.: An analytical contrast between fitness maximization and selection for mixability. J. Theor. Biol. (2011)Google Scholar
  8. 8.
    Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007); Chapter 18 by Tim RoughgardenzbMATHCrossRefGoogle Scholar
  9. 9.
    Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1996)Google Scholar
  10. 10.
    Papadimitriou, C.H., Schapira, M., Singer, Y.: On the Hardness of Being Truthful. In: FOCS 2008, pp. 250–259 (2008)Google Scholar
  11. 11.
    Papadimitriou, C.H., Yannakakis, M.: On the Approximability of Trade-offs and Optimal Access of Web Sources. In: FOCS 2000, pp. 86–92 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Christos H. Papadimitriou
    • 1
  1. 1.University of California at BerkeleyUSA

Personalised recommendations