Minimax and Applications (Nonconvex Optimization and Its Applications (closed))

Classical minimax theory (von Neumann), duality and saddle point analysis have together played a critical role in optimization and game theory. It is currently recognised that minimax problems and techniques appear throughout a broad spectrum of disciplines, including game theory, optimization, and computational complexity. Many interesting and sophisticated problems are formulated as minimax applications, as in the fields of combinatorial optimization, scheduling, location, packing, searching, and triangulation. The contributions to Minimax and Applications cover a wide range of topics and provide an excellent picture of recent research and developments in minimax theory.
Audience: Accessible to graduate students as well as researchers in optimization, computer science, and related areas.