Sciweavers

344 search results - page 2 / 69
» Banach-Mazur Games on Graphs
Sort
View
ECML
2007
Springer
14 years 16 days ago
Graph-Based Domain Mapping for Transfer Learning in General Games
A general game player is an agent capable of taking as input a description of a game’s rules in a formal language and proceeding to play without any subsequent human input. To do...
Gregory Kuhlmann, Peter Stone
GD
2003
Springer
13 years 11 months ago
HexGraph: Applying Graph Drawing Algorithms to the Game of Hex
Hex is a classic board game for two players. There exists an intuitive mapping of the state of a hex game onto a graph. The motivation of the work presented in this paper was to cr...
Colin Murray, Carsten Friedrich, Peter Eades
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 28 days ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
DIGRA
2005
Springer
13 years 12 months ago
Game Engineering for a Multiprocessor Architecture
This paper explores the idea that future game consoles and computers may no longer be single processor units, but instead symmetrical multiprocessor units. If this were to occur g...
Abdennour El Rhalibi, Steve Costa, David England
FSTTCS
2009
Springer
14 years 28 days ago
Nash Equilibrium in Generalised Muller Games
We suggest that extending Muller games with preference ordering for players is a natural way to reason about unbounded duration games. In this context, we look at the standard solu...
Soumya Paul, Sunil Easaw Simon