Torrent details for "Griffin C. Game Theory Explained. A Mathematical Introduction Wi…" Log in to bookmark
Controls:
×
Report Torrent
Please select a reason for reporting this torrent:
Your report will be reviewed by our moderation team.
×
Report Information
Loading report information...
This torrent has been reported 0 times.
Report Summary:
| User | Reason | Date |
|---|
Failed to load report information.
×
Success
Your report has been submitted successfully.
Checked by:
Category:
Language:
None
Total Size:
7.2 MB
Info Hash:
7489C64D57F950D1AFAD2083E123AED15ED7B549
Added By:
Added:
April 21, 2026, 12:26 a.m.
Stats:
|
(Last updated: April 21, 2026, 12:26 a.m.)
| File | Size |
|---|---|
| ['Griffin C. Game Theory Explained. A Mathematical Introduction With Optimiz. 2025.pdf'] | 0 bytes |
Name
DL
Uploader
Size
S/L
Added
NOTE
SOURCE: Griffin C. Game Theory Explained. A Mathematical Introduction With Optimiz. 2025
-----------------------------------------------------------------------------------
COVER
-----------------------------------------------------------------------------------
MEDIAINFO
Textbook in PDF format This book provides an introduction to the mathematical theory of games using both classical methods and optimization theory. Employing a theorem-proof-example approach, the book emphasizes not only results in game theory, but also how to prove them. Part 1 of the book focuses on classical results in games, beginning with an introduction to probability theory by studying casino games and ending with Nash's proof of the existence of mixed strategy equilibria in general sum games. On the way, utility theory, game trees and the minimax theorem are covered with several examples. Part 2 introduces optimization theory and the Karush–Kuhn–Tucker conditions and illustrates how games can be rephrased as optimization problems, thus allowing Nash equilibria to be computed. Part 3 focuses on cooperative games. In this unique presentation, Nash bargaining is recast as a multi-criteria optimization problem and the results from linear programming and duality are revived to prove the classic Bondareva–Shapley theorem. Two appendices covering prerequisite materials are provided, and a "bonus" appendix with an introduction to evolutionary games allows an instructor to swap out some classical material for a modern, self-contained discussion of the replicator dynamics, the author's particular area of study
×