Sciweavers

356 search results - page 3 / 72
» Graph Games on Ordinals
Sort
View
AML
2005
82views more  AML 2005»
13 years 6 months ago
The canonical function game
The canonical function game is a game of length 1 introduced by W. Hugh Woodin which falls inside a class of games known as Neeman games. Using large cardinals, we show that it is...
Paul B. Larson
ICTAI
2008
IEEE
14 years 20 days ago
A Model for Multiple Outcomes Games
We introduce and study qualitative multiple outcomes games. These games are noncooperative games with qualitative utilities (i.e., values over an ordinal scale), strictly qualitat...
Ramzi Ben Larbi, Sébastien Konieczny, Pierr...
FSTTCS
1994
Springer
13 years 10 months ago
Finite-State Strategies in Regular Infinite Games
Abstract. This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller ...
Wolfgang Thomas
JGAA
2007
123views more  JGAA 2007»
13 years 6 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta
CONCUR
2006
Springer
13 years 10 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger