Search results
Results From The WOW.Com Content Network
Constant sum: A game is a constant sum game if the sum of the payoffs to every player are the same for every single set of strategies. In these games, one player gains if and only if another player loses. A constant sum game can be converted into a zero sum game by subtracting a fixed value from all payoffs, leaving their relative order unchanged.
Algorithmic game theory (AGT) is an area in the intersection of game theory and computer science, with the objective of understanding and design of algorithms in strategic environments. Typically, in Algorithmic Game Theory problems, the input to a given algorithm is distributed among many players who have a personal interest in the output.
Thus while their assumptions do not always hold, they can treat game theory as a reasonable scientific ideal akin to the models used by physicists. However, empirical work has shown that in some classic games, such as the centipede game, guess 2/3 of the average game, and the dictator game, people regularly do not play Nash equilibria. There is ...
An important notion in combinatorial game theory is that of the solved game. For example, tic-tac-toe is considered a solved game, as it can be proven that any game will result in a draw if both players play optimally. Deriving similar results for games with rich combinatorial structures is difficult.
In applied game theory, the definition of the strategy sets is an important part of the art of making a game simultaneously solvable and meaningful. The game theorist can use knowledge of the overall problem, that is the friction between two or more players, to limit the strategy spaces, and ease the solution.
The von Neumann Lecture is delivered by an individual who has made important developments in game theory that are of significant mathematical interest. In addition, the society awards the Kalai Prize to a person (or persons) who have published a significant paper at the interface of game theory and computer science. [5]
Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!
Kevin Leyton-Brown (born May 12, 1975) is a Professor of Computer Science at the University of British Columbia. [1] He received his Ph.D. at Stanford University in 2003. [2] He was the recipient of a 2014 NSERC E.W.R. Steacie Memorial Fellowship, [3] a 2013/14 Killam Teaching Prize, [4] and a 2013 Outstanding Young Computer Science Researcher Prize from the Canadian Association of Computer ...