In recent years global optimization has found applications in many interesting areas of science and technology including molecular biology, chemical equilibrium problems, medical imaging and networks. The collection of papers in this book indicates the diverse applicability of global optimization. Furthermore, various algorithmic, theoretical developments and computational studies are presented. Audience: All researchers and students working in mathematical programming.

This volume collects the expanded notes of four series of lectures given on the occasion of the CIME course on Nonlinear Optimization held in Cetraro, Italy, from July 1 to 7, 2007. The Nonlinear Optimization problem of main concern here is the problem n of determining a vector of decision variables x ? R that minimizes (ma- n mizes) an objective function f(.): R ? R, when x is restricted to belong n to some feasible setF? R, usually described by a set of equality and - n n m equality constraints: F = {x ? R: h(x)=0, h(.): R ? R; g(x) ? 0, n p g(.): R ? R }; of course it is intended that at least one of the functions f, h, g is nonlinear. Although the problem canbe stated in verysimpleterms, its solution may result very di?cult due to the analytical properties of the functions involved and/or to the number n, m, p of variables and constraints. On the other hand, the problem has been recognized to be of main relevance in engineering, economics, and other applied sciences, so that a great lot of e?ort has been devoted to develop methods and algorithms able to solve the problem even in its more di?cult and large instances. The lectures have been given by eminent scholars, who contributed to a great extent to the development of Nonlinear Optimization theory, methods and algorithms. Namely, they are: - Professor Immanuel M."

In recent years global optimization has found applications in many interesting areas of science and technology including molecular biology, chemical equilibrium problems, medical imaging and networks. The collection of papers in this book indicates the diverse applicability of global optimization. Furthermore, various algorithmic, theoretical developments and computational studies are presented. Audience: All researchers and students working in mathematical programming.

These Lecture Notes arose from discussions we had over a working paper written by the first author in fall 1987. We decided then to write a short paper about the basic structure of evolutionary stability and found ourselves ending up with a book manuscript. Parts of the material contained herein were presented in a seminar at the Department of Mathematics at the University of Vienna, as well as at a workshop on evolutionary game theory in Bielefeld. The final version of the manuscript has certainly benefitted from critical comments and suggestions by the participants of both the seminar and the workshop. Thanks are also due to S. Bomze-de Barba, R. Burger, G. Danninger, J. Hofbauer, R. Selten, K. Sigmund, G. Stiastny and F. Weising. The co-operation of W. Muller from Springer Verlag, Heidelberg, is gratefully acknowledged. Vienna, November 1988 Immanuel M. Bomze Benedikt M. Potscher III Contents 1. Introduction 1 2. Strategies and payoffs 5 2. 1. A general setting for evolutionary game theory 6 2. 2. Mixed strategies and population games 8 2. 3. Finite number of strategies . . . . . 13 2. 4. Infinitely many (pure) strategies 15 2. 5. Structured populations: asymmetric contests and multitype games 17 2. 6. Additional remarks . . . . . . . . . . . . . . . . . . . . . 21 3. Evolutionary stability 25 3. 1. Definition of evolutionary stability 25 3. 2. Evolutionary stability and solution concepts in classical game theory 30 3. 3. Conditions for evolutionary stability based on the normal cone 31 3. 4.