Introducing Game Theory and its Applications

Introducing Game Theory and its Applications

4.08 (12 ratings by Goodreads)
By (author) 

Free delivery worldwide

Available. Dispatched from the UK in 11 business days
When will my order arrive?

Description

The mathematical study of games is an intriguing endeavor with implications and applications that reach far beyond tic-tac-toe, chess, and poker to economics, business, and even biology and politics. Most texts on the subject, however, are written at the graduate level for those with strong mathematics, economics, or business backgrounds. In a clear and refreshing departure from this trend, Introducing Game Theory and its Applications presents an easy-to-read introduction to the basic ideas and techniques of game theory. After a brief introduction, the author begins with a chapter devoted to combinatorial games--a topic neglected or treated minimally in most other texts. The focus then shifts to two-person zero-sum games and their solution. Here the author presents the simplex method, based on linear programming, for solving these games and develops within his presentation the required background in linear programming. The final chapter presents some of the fundamental ideas and tools of non-zero-sum games and games with more than two players, including an introduction to cooperative game theory. This book will not only satisfy the curiosity of those whose interest in the subject was piqued by the 1994 Nobel Prize awarded to Harsanyi, Nash, and Selten. It also prepares its readers for more advanced study of game theory's applications in economics, business, and the physical, biological, and social sciences.show more

Product details

  • Hardback | 272 pages
  • 156 x 240 x 20mm | 521.64g
  • Taylor & Francis Inc
  • Chapman & Hall/CRC
  • Boca Raton, FL, United States
  • English
  • UK ed.
  • 27 black & white illustrations, 182 black & white tables
  • 1584883006
  • 9781584883005
  • 1,268,356

Table of contents

Introduction COMBINATORIAL GAMES Definition of Combinatorial Game The Fundamental Theorem for Combinatorial Games Nim Hex and Other Games Tree Games Grundy Functions Bogus Nim-Sums TWO-PERSON ZERO-SUM GAMES Games in Normal Form Saddle Points and Equilibrium Pairs Maximin and Minimax Mixed Strategies 2 x 2 Matrix Games 2 x n, m x 2, and 3 x 3 Matrix Games Linear Programming. Von Neumann's Theorem THE SIMPLEX METHOD. THE FUNDAMENTAL THEOREM OF DUALITY. SOLUTION OF TWO-PERSON ZERO-SUM GAMES. Slack Variables. Perfect Canonical Linear Programming Problems The Simplex Method Pivoting The Perfect Phase of the Simplex Method The Big M Method Bland's Rules to Prevent Cycling Duality and the Simplex Method Solution of Game Matrices Proofs of Facts 1-4 NON-ZERO-SUM GAMES AND k-PERSON GAMES The General Setting Nash Equilibria Graphical Method for Finding Nash Equilibria for 2 ' 2 Matrices Inadequacies of Nash Equilibria in Non-Zero-Sum Games. Cooperative Games The Nash Arbitration Procedure Games with Two or More Players Coalitions Games in Coalition Form The Shapley Value Strategic Equivalence Stable Sets APPENDICES Finite Probability Theory Utility Theory Nash's Theorem Answers to Selected Exercises Bibliography INDEXshow more

Rating details

12 ratings
4.08 out of 5 stars
5 50% (6)
4 17% (2)
3 25% (3)
2 8% (1)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X