Ad
related to: practical application of game theory
Search results
Results From The WOW.Com Content Network
The application of game theory to political science is focused in the overlapping areas of fair division, political economy, public choice, war bargaining, positive political theory, and social choice theory. In each of these areas, researchers have developed game-theoretic models in which the players are often voters, states, special interest ...
In 1988, John Werner, a first-year student, successfully organized his classmates to boycott the exam, demonstrating a practical application of game theory and the prisoner's dilemma concept. [49] Nearly 25 years later, a similar incident occurred at Johns Hopkins University in 2013. Professor Peter Fröhlich's grading policy scaled final exams ...
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.
It is considered to be the leading journal of game theory and one of the top journals in economics, and it is one of the two official journals of the Game Theory Society. [2] Apart from game theory and economics, the research areas of the journal also include applications of game theory in political science, biology, computer science ...
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.
Metagame theory was developed by Nigel Howard in the 1960s as a reconstruction of mathematical game theory on a non-quantitative basis, hoping that it would thereby make more practical and intuitive sense (Howard 1971, pp. xi).
In mathematics, economics and computer science, particularly in the fields of combinatorics, game theory and algorithms, the stable-roommate problem (SRP) is the problem of finding a stable matching for an even-sized set. A matching is a separation of the set into disjoint pairs ("roommates").
Coalitional game theory is a branch of game theory that deals with cooperative behavior. In a coalitional game, the key idea is to study the formation of cooperative groups, i.e., coalitions among a number of players. By cooperating, the players can strengthen their position in a given game as well as improve their utilities.