Search results
Results from the WOW.Com Content Network
Michael Bahir Maschler (Hebrew: מיכאל בהיר משלר) (July 22, 1927 – July 20, 2008) was an Israeli mathematician well known for his contributions to the field of game theory. He was a professor in the Einstein Institute of Mathematics and the Center for the Study of Rationality at the Hebrew University of Jerusalem in Israel.
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. [124] Yao's principle is a game-theoretic technique for proving lower bounds on the computational complexity of randomized algorithms , especially online ...
Conditions on G (the stage game) – whether there are any technical conditions that should hold in the one-shot game in order for the theorem to work. Conditions on x (the target payoff vector of the repeated game) – whether the theorem works for any individually rational and feasible payoff vector, or only on a subset of these vectors.
Aumann and Maschler used game theory to analyze Talmudic dilemmas. [5] They were able to solve the mystery about the "division problem" , a long-standing dilemma of explaining the Talmudic rationale in dividing the heritage of a late husband to his three wives depending on the worth of the heritage compared to its original worth. [ 6 ]
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.
In game theory, a Bayesian game is a strategic decision-making model which assumes players have incomplete information. Players may hold private information relevant to the game, meaning that the payoffs are not common knowledge. [1] Bayesian games model the outcome of player interactions using aspects of Bayesian probability.
In contrast, in classic game theory, even complex games are treated as single, monolithic objects. This makes the analysis of games hard to scale. Compositional game theory (CGT) aims to apply the modularity principle to game theory. The main motivation is to make it easier to analyze large games using software tools.
Combinatorial game theory has a different emphasis than "traditional" or "economic" game theory, which was initially developed to study games with simple combinatorial structure, but with elements of chance (although it also considers sequential moves, see extensive-form game).