Математика
Различные книги в жанре МатематикаGame Theory
A fundamental introduction to modern game theory from a mathematical viewpoint Game theory arises in almost every fact of human and inhuman interaction since oftentimes during these communications objectives are opposed or cooperation is viewed as an option. From economics and finance to biology and computer science, researchers and practitioners are often put in complex decision-making scenarios, whether they are interacting with each other or working with evolving technology and artificial intelligence. Acknowledging the role of mathematics in making logical and advantageous decisions, Game Theory: An Introduction uses modern software applications to create, analyze, and implement effective decision-making models. While most books on modern game theory are either too abstract or too applied, this book provides a balanced treatment of the subject that is both conceptual and hands-on. Game Theory introduces readers to the basic theories behind games and presents real-world examples from various fields of study such as economics, political science, military science, finance, biological science as well as general game playing. A unique feature of this book is the use of Maple to find the values and strategies of games, and in addition, it aids in the implementation of algorithms for the solution or visualization of game concepts. Maple is also utilized to facilitate a visual learning environment of game theory and acts as the primary tool for the calculation of complex non-cooperative and cooperative games. Important game theory topics are presented within the following five main areas of coverage: Two-person zero sum matrix games Nonzero sum games and the reduction to nonlinear programming Cooperative games, including discussion of both the Nucleolus concept and the Shapley value Bargaining, including threat strategies Evolutionary stable strategies and population games Although some mathematical competence is assumed, appendices are provided to act as a refresher of the basic concepts of linear algebra, probability, and statistics. Exercises are included at the end of each section along with algorithms for the solution of the games to help readers master the presented information. Also, explicit Maple and Mathematica® commands are included in the book and are available as worksheets via the book's related Web site. The use of this software allows readers to solve many more advanced and interesting games without spending time on the theory of linear and nonlinear programming or performing other complex calculations. With extensive examples illustrating game theory's wide range of relevance, this classroom-tested book is ideal for game theory courses in mathematics, engineering, operations research, computer science, and economics at the upper-undergraduate level. It is also an ideal companion for anyone who is interested in the applications of game theory.
Combinatorial Optimization
A complete, highly accessible introduction to one of today's most exciting areas of applied mathematics One of the youngest, most vital areas of applied mathematics, combinatorial optimization integrates techniques from combinatorics, linear programming, and the theory of algorithms. Because of its success in solving difficult problems in areas from telecommunications to VLSI, from product distribution to airline crew scheduling, the field has seen a ground swell of activity over the past decade. Combinatorial Optimization is an ideal introduction to this mathematical discipline for advanced undergraduates and graduate students of discrete mathematics, computer science, and operations research. Written by a team of recognized experts, the text offers a thorough, highly accessible treatment of both classical concepts and recent results. The topics include: * Network flow problems * Optimal matching * Integrality of polyhedra * Matroids * NP-completeness Featuring logical and consistent exposition, clear explanations of basic and advanced concepts, many real-world examples, and helpful, skill-building exercises, Combinatorial Optimization is certain to become the standard text in the field for many years to come.
Graph Theory
A lively invitation to the flavor, elegance, and power of graph theory This mathematically rigorous introduction is tempered and enlivened by numerous illustrations, revealing examples, seductive applications, and historical references. An award-winning teacher, Russ Merris has crafted a book designed to attract and engage through its spirited exposition, a rich assortment of well-chosen exercises, and a selection of topics that emphasizes the kinds of things that can be manipulated, counted, and pictured. Intended neither to be a comprehensive overview nor an encyclopedic reference, this focused treatment goes deeply enough into a sufficiently wide variety of topics to illustrate the flavor, elegance, and power of graph theory. Another unique feature of the book is its user-friendly modular format. Following a basic foundation in Chapters 1-3, the remainder of the book is organized into four strands that can be explored independently of each other. These strands center, respectively, around matching theory; planar graphs and hamiltonian cycles; topics involving chordal graphs and oriented graphs that naturally emerge from recent developments in the theory of graphic sequences; and an edge coloring strand that embraces both Ramsey theory and a self-contained introduction to Pólya's enumeration of nonisomorphic graphs. In the edge coloring strand, the reader is presumed to be familiar with the disjoint cycle factorization of a permutation. Otherwise, all prerequisites for the book can be found in a standard sophomore course in linear algebra. The independence of strands also makes Graph Theory an excellent resource for mathematicians who require access to specific topics without wanting to read an entire book on the subject.
Random Graphs
A unified, modern treatment of the theory of random graphs-including recent results and techniques Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of the discrete mathematics community, the book incorporates many disparate results from across the literature, including results obtained by the authors and some completely new results. Current tools and techniques are also thoroughly emphasized. Clear, easily accessible presentations make Random Graphs an ideal introduction for newcomers to the field and an excellent reference for scientists interested in discrete mathematics and theoretical computer science. Special features include: * A focus on the fundamental theory as well as basic models of random graphs * A detailed description of the phase transition phenomenon * Easy-to-apply exponential inequalities for large deviation bounds * An extensive study of the problem of containing small subgraphs * Results by Bollobas and others on the chromatic number of random graphs * The result by Robinson and Wormald on the existence of Hamilton cycles in random regular graphs * A gentle introduction to the zero-one laws * Ample exercises, figures, and bibliographic references
Cellular Automata
An accessible and multidisciplinaryintroduction to cellular automata As the applicability of cellular automata broadens and technology advances, there is a need for a concise, yet thorough, resource that lays the foundation of key cellularautomata rules and applications. In recent years, Stephen Wolfram's A New Kind of Science has brought the modeling power that lies in cellular automata to the attentionof the scientific world, and now, Cellular Automata: A Discrete View of the World presents all the depth, analysis, and applicability of the classic Wolfram text in a straightforward, introductory manner. This book offers an introduction to cellular automata as a constructive method for modeling complex systems where patterns of self-organization arising from simple rules are revealed in phenomena that exist across a wide array of subject areas, including mathematics, physics, economics, and the social sciences. The book begins with a preliminary introduction to cellular automata, including a brief history of the topic along with coverage of sub-topics such as randomness, dimension, information, entropy, and fractals. The author then provides a complete discussion of dynamical systems and chaos due to their close connection with cellular automata and includes chapters that focus exclusively on one- and two-dimensional cellular automata. The next and most fascinating area of discussion is the application of these types of cellular automata in order to understand the complex behavior that occurs in natural phenomena. Finally, the continually evolving topic of complexity is discussed with a focus on how to properly define, identify, and marvel at its manifestations in various environments. The author's focus on the most important principles of cellular automata, combined with his ability to present complex material in an easy-to-follow style, makes this book a very approachable and inclusive source for understanding the concepts and applications of cellular automata. The highly visual nature of the subject is accented with over 200 illustrations, including an eight-page color insert, which provide vivid representations of the cellular automata under discussion. Readers also have the opportunity to follow and understand the models depicted throughout the text and create their own cellular automata using Java applets and simple computer code, which are available via the book's FTP site. This book serves as a valuable resource for undergraduate and graduate students in the physical, biological, and social sciences and may also be of interest to any reader with a scientific or basic mathematical background.
Fragile Networks
A unified treatment of the vulnerabilities that exist in real-world network systems—with tools to identify synergies for mergers and acquisitions Fragile Networks: Identifying Vulnerabilities and Synergies in an Uncertain World presents a comprehensive study of network systems and the roles these systems play in our everyday lives. This book successfully conceptualizes, defines, and constructs mathematically rigorous, computer-based tools for the assessment of network performance and efficiency, along with robustness and vulnerability analysis. The result is a thorough exploration that promotes an understanding of the critical infrastructure of today's network systems, from congested urban transportation networks and supply chain networks under disruption to financial networks and the Internet. The authors approach the analyses by abstracting not only topological structures of networks, but also the behavior of network users, the demand for resources, the resulting flows, and the associated costs. Following an introduction to the fundamental methodologies and tools required for network analysis and network vulnerability, the book is organized into three self-contained parts: Part I—Network Fundamentals, Efficiency Measurement, and Vulnerability Analysis explores the theoretical and practical foundations for a new network efficiency measure in order to assess the importance of network components in various network systems. Methodologies for distinct decision-making behaviors are outlined, along with the tools for qualitative analysis, the algorithms for the computation of solutions, and a thorough discussion of the unified network efficient measure and network robustness with the unified measure. Part II—Applications and Extensions examines the efficiency changes and the associated cost increments after network components are eliminated or partially damaged. A discussion of the recently established connections between transportation networks and different critical networks is provided, which demonstrates how the new network measures and robustness indices can be applied to different supply chain, financial, and dynamic networks, including the Internet and electronic power networks. Part III—Mergers and Acquisitions, Network Integration, and Synergies reveals the connections between transportation networks and different network systems and quantifies the synergies associated with the network systems, from total cost reduction to environmental impact assessment. In the case of mergers and acquisitions, the focus is on supply chain networks. The authors outline a system-optimization perspective for supply chain networks and also formalize coalition formation using game theory with insights into the merger paradox. With its numerous network examples and real-world applications, Fragile Networks: Identifying Vulnerabilities and Synergies in an Uncertain World is an excellent book for courses in network science, transportation science, operations management, and financial networks at the upper-undergraduate and graduate levels. It is also a valuable reference for researchers and practitioners in the areas of applied mathematics, computer science, operations research, management science, finance, and economics, as well as industrial, systems, and civil engineering. Listen to Dr. Nagurney's podcast Supernetworks: Building Better Real and Virtual Highways at http://www.scienceofbetter.org/podcast/ .
Integral Equations
This classic work is now available in an unabridged paperback edition. Hochstatdt's concise treatment of integral equations represents the best compromise between the detailed classical approach and the faster functional analytic approach, while developing the most desirable features of each. The seven chapters present an introduction to integral equations, elementary techniques, the theory of compact operators, applications to boundary value problems in more than dimension, a complete treatment of numerous transform techniques, a development of the classical Fredholm technique, and application of the Schauder fixed point theorem to nonlinear equations.
Special Functions
This book gives an introduction to the classical, well-known special functions which play a role in mathematical physics, especially in boundary value problems. Calculus and complex function theory form the basis of the book and numerous formulas are given. Particular attention is given to asymptomatic and numerical aspects of special functions, with numerous references to recent literature provided.
Advanced Calculus
Features an introduction to advanced calculus and highlights its inherent concepts from linear algebra Advanced Calculus reflects the unifying role of linear algebra in an effort to smooth readers' transition to advanced mathematics. The book fosters the development of complete theorem-proving skills through abundant exercises while also promoting a sound approach to the study. The traditional theorems of elementary differential and integral calculus are rigorously established, presenting the foundations of calculus in a way that reorients thinking toward modern analysis. Following an introduction dedicated to writing proofs, the book is divided into three parts: Part One explores foundational one-variable calculus topics from the viewpoint of linear spaces, norms, completeness, and linear functionals. Part Two covers Fourier series and Stieltjes integration, which are advanced one-variable topics. Part Three is dedicated to multivariable advanced calculus, including inverse and implicit function theorems and Jacobian theorems for multiple integrals. Numerous exercises guide readers through the creation of their own proofs, and they also put newly learned methods into practice. In addition, a «Test Yourself» section at the end of each chapter consists of short questions that reinforce the understanding of basic concepts and theorems. The answers to these questions and other selected exercises can be found at the end of the book along with an appendix that outlines key terms and symbols from set theory. Guiding readers from the study of the topology of the real line to the beginning theorems and concepts of graduate analysis, Advanced Calculus is an ideal text for courses in advanced calculus and introductory analysis at the upper-undergraduate and beginning-graduate levels. It also serves as a valuable reference for engineers, scientists, and mathematicians.
Fourier Analysis
A reader-friendly, systematic introduction to Fourier analysis Rich in both theory and application, Fourier Analysis presents a unique and thorough approach to a key topic in advanced calculus. This pioneering resource tells the full story of Fourier analysis, including its history and its impact on the development of modern mathematical analysis, and also discusses essential concepts and today's applications. Written at a rigorous level, yet in an engaging style that does not dilute the material, Fourier Analysis brings two profound aspects of the discipline to the forefront: the wealth of applications of Fourier analysis in the natural sciences and the enormous impact Fourier analysis has had on the development of mathematics as a whole. Systematic and comprehensive, the book: Presents material using a cause-and-effect approach, illustrating where ideas originated and what necessitated them Includes material on wavelets, Lebesgue integration, L2 spaces, and related concepts Conveys information in a lucid, readable style, inspiring further reading and research on the subject Provides exercises at the end of each section, as well as illustrations and worked examples throughout the text Based upon the principle that theory and practice are fundamentally linked, Fourier Analysis is the ideal text and reference for students in mathematics, engineering, and physics, as well as scientists and technicians in a broad range of disciplines who use Fourier analysis in real-world situations.