Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Synopsis
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.
Booknews
Reports on selected topics from recent research in minimax theory, focusing on the classical theorems, optimization problems using duality theory, optimality, and approximate algorithms. Among the 18 papers are discussions of minimax trees and associated algorithms, an iterative method, the on-line scheduling of two-stage shops, apportioning seats to a parliament, mutually repellant sampling, problems of six points and seven points in a planar convex body, and the counterfeit coin problem. A final paper explores minimax problems in combinatorial optimization. Accessible to graduate students and researchers in optimization, computer science, and related disciplines. No subject index. Annotation c. Book News, Inc., Portland, OR (booknews.com)