Search results
Results from the WOW.Com Content Network
The Art of Computer Game Design by Chris Crawford is the first book [1] devoted to the theory of computer and video games. The book attempts to categorize computer games and talks about design precepts that serve as guidelines for game designers. It was originally published in Berkeley, California, by McGraw-Hill/Osborne Media in
Separately, game theory has played a role in online algorithms; in particular, the k-server problem, which has in the past been referred to as games with moving costs and request-answer games. [125] Yao's principle is a game-theoretic technique for proving lower bounds on the computational complexity of randomized algorithms , especially online ...
It should only contain pages that are Books about game theory or lists of Books about game theory, as well as subcategories containing those things (themselves set categories). Topics about Books about game theory in general should be placed in relevant topic categories .
Theory of Games and Economic Behavior, published in 1944 [1] by Princeton University Press, is a book by mathematician John von Neumann and economist Oskar Morgenstern which is considered the groundbreaking text that created the interdisciplinary research field of game theory.
A Rubinstein bargaining model refers to a class of bargaining games that feature alternating offers through an infinite time horizon. The original proof is due to Ariel Rubinstein in a 1982 paper. [1] For a long time, the solution to this type of game was a mystery; thus, Rubinstein's solution is one of the most influential findings in game theory.
The Video Game Theory Reader edited by Mark J.P. Wolf and Bernard Perron. The Video Game Theory Reader 2 edited by Bernard Perron and Mark J.P. Wolf. The following are taken from Recommended Reading lists in the Centennial College Seminar Series: The Video Game Industry Lecture Series handouts (2005): Creating the Art of the Game by Matthew ...
In game theory, a solution concept is a formal rule for predicting how a game will be played. These predictions are called "solutions", and describe which strategies will be adopted by players and, therefore, the result of the game. The most commonly used solution concepts are equilibrium concepts, most famously Nash equilibrium.
Aumann was the first to define the concept of correlated equilibrium in game theory, which is a type of equilibrium in non-cooperative games that is more flexible than the classical Nash equilibrium. Furthermore, Aumann has introduced the first purely formal account of the notion of common knowledge in game theory.