Introducing Game Theory and its Applications
CRC Press, 2004 M07 3 - 272 páginas
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.
Comentarios de la gente - Escribir un comentario
No encontramos ningún comentario en los lugares habituales.
Otras ediciones - Ver todas
arbitration procedure assume basic point basic variables binary decomposition Black Bland's Rules chip choose coalition game coefficients combinatorial game Consider the game consists dominates entry equation equilibrium pair Exercise expected pay-off Find a winning following game G-number game matrix game of Example game theory graph Grundy number Hence hexagons imputation ith row k-tuple last person line segment lottery lpp's matrix games maximin strategy maximum minimax Minimize minimum mixed Nash equilibrium move wins negotiation set non-basic variables non-losing strategy nonnegative number of objects objective function objective row obtain occurs odd number Opt(p optimal strategy outcomes pay-offs person to move pile pivot with respect plays strategy probability proof pure Nash equilibrium pure strategy real numbers remove result saddle point second player Shapley value simplex method solution square sticks strategy for player strategy X superadditivity Tic-Tac-Toe von Neumann's Theorem White winning strategy yields