Sciweavers

1599 search results - page 25 / 320
» Algorithms for Parity Games
Sort
View
FSTTCS
2005
Springer
15 years 3 months ago
Fixpoint Logics on Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
CONCUR
2006
Springer
15 years 1 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
97
Voted
ATAL
2010
Springer
14 years 10 months ago
Monotone cooperative games and their threshold versions
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...
Haris Aziz, Felix Brandt, Paul Harrenstein
JGAA
2007
123views more  JGAA 2007»
14 years 9 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
78
Voted
FLAIRS
2007
14 years 12 months ago
The Design and Implementation of a Successful General Game Playing Agent
General Game Playing is the problem of designing an agent capable of playing any previously unknown game when given only the rules. This paper describes the implementation archite...
David M. Kaiser