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.
John Harsanyi – equilibrium theory (Nobel Memorial Prize in Economic Sciences in 1994) Monika Henzinger – algorithmic game theory and information retrieval; John Hicks – general equilibrium theory (including Kaldor–Hicks efficiency) Naira Hovakimyan – differential games and adaptive control; Peter L. Hurd – evolution of aggressive ...
A solved game is a game whose outcome (win, lose or draw) can be correctly predicted from any position, assuming that both players play perfectly.This concept is usually applied to abstract strategy games, and especially to games with full information and no element of chance; solving such a game may use combinatorial game theory or computer assistance.
The prisoner's dilemma is a game theory thought experiment involving two rational agents, each of whom can either cooperate for mutual benefit or betray their partner ("defect") for individual gain. The dilemma arises from the fact that while defecting is rational for each agent, cooperation yields a higher payoff for each.
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.
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 ...
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.