Results 11  20
of
325,959
Computing equilibria in two–player zero–sum continuous stochastic games with switching
"... controller ..."
Persistent equilibria
 International Journal of Game Theory
, 1984
"... We introduce a new solution concept for games in extensive form with perfect information: the valuation equilibrium. The moves of each player are partitioned into similarity classes. A valuation of the player is a real valued function on the set of her similarity classes. At each node a player choos ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
based valuation equilibrium (ASVE). While the Subgame Perfect Nash Equilibrium is always an ASVE, there are other ASVE in general. But, in zerosum twoplayer games without chance moves every player must get her value in any ASVE.
Valuation Equilibria
 International Journal of Game Theory
, 2003
"... We introduce a new solution concept for games in extensive form with perfect information: the valuation equilibrium. The moves of each player are partitioned into similarity classes. A valuation of the player is a real valued function on the set of her similarity classes. At each node a player ch ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
based valuation equilibrium (ASVE). While the Subgame Perfect Nash Equilibrium is always an ASVE, there are other ASVE in general. But, in zerosum twoplayer games without chance moves every player must get her value in any ASVE.
Knowledge Engineering GroupOn Solving Pentago
"... Hiermit versichere ich, die vorliegende BachelorThesis ohne Hilfe Dritter nur mit den angegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus Quellen entnommen wurden, sind als solche kenntlich gemacht. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbe ..."
Abstract
 Add to MetaCart
Prüfungsbehörde vorgelegen. Darmstadt, den 21. April 2011 (Niklas Büscher) This thesis deals with the different ways to solve games, with a special focus on solving the game of Pentago. Pentago is a new and hence until now unvisited, zerosum twoplayer game with perfect information. We approximate the state
An Optimally Randomized Minimax Algorithm (manuscript submitted for publication and subject to change)
"... This short paper proposes a simple extension of the celebrated MINIMAX algorithm used in zerosum twoplayer games, called Rminimax. The Rminimax algorithm allows controlling the strength of an artificial rival by randomizing its strategy in an optimal way. In particular, the randomized shortestpat ..."
Abstract
 Add to MetaCart
This short paper proposes a simple extension of the celebrated MINIMAX algorithm used in zerosum twoplayer games, called Rminimax. The Rminimax algorithm allows controlling the strength of an artificial rival by randomizing its strategy in an optimal way. In particular, the randomized shortest
An Optimally Randomized Minimax Algorithm
"... This short paper proposes a simple extension of the celebrated MINIMAX algorithm used in zerosum twoplayer games, called Rminimax. The Rminimax algorithm allows controlling the strength of an artificial rival by randomizing its strategy in an optimal way. In particular, the randomized shortestpat ..."
Abstract
 Add to MetaCart
This short paper proposes a simple extension of the celebrated MINIMAX algorithm used in zerosum twoplayer games, called Rminimax. The Rminimax algorithm allows controlling the strength of an artificial rival by randomizing its strategy in an optimal way. In particular, the randomized shortest
On the uniqueness of equilibrium in symmetric twoplayer zerosum games with integer payoffs. Économie publique
, 2005
"... Consider a symmetric twoplayer zerosum game with integer payo¤s. We prove that if there exists an integer such that all upperdiagonal payo¤ entries have the same nonzero reminder when divided by this integer, then the game has a unique equilibrium in mixed strategies. 1 ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Consider a symmetric twoplayer zerosum game with integer payo¤s. We prove that if there exists an integer such that all upperdiagonal payo¤ entries have the same nonzero reminder when divided by this integer, then the game has a unique equilibrium in mixed strategies. 1
The Value of Information in ZeroSum Games
, 2001
"... It is not true that the value of information is positive in economic situations, as shown for instance by the Hirshleifer (1971) paradoxes. Recall the following example of information rejection, which is a variant of the example provided by Kamien, Tauman and Zamir (1986). A card in a deck can be wh ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
be white or black, with equal probabilities. Two players, player 1 and 2 are sequentially asked to guess the color of the card. A player gets a payoff of 6 if he/she is the only one to guess right, both players get a value of 2 if both guess right, and a player guessing wrong gets 0. Assume that no player
The lagging anchor algorithm: reinforcement learning in twoplayer zerosum games with imperfect information
 Machine Learning
, 2002
"... Abstract. The article describes a gradient search based reinforcement learning algorithm for twoplayer zerosum games with imperfect information. Simple gradient search may result in oscillation around solution points, a problem similar to the “Crawford puzzle”. To dampen oscillations, the algorithm ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. The article describes a gradient search based reinforcement learning algorithm for twoplayer zerosum games with imperfect information. Simple gradient search may result in oscillation around solution points, a problem similar to the “Crawford puzzle”. To dampen oscillations
Results 11  20
of
325,959