5995 search results - page 49 / 1199 » Algorithmic Game Theory |
109
Voted
DIGRA
2005
Springer
15 years 5 months ago
2005
Springer
The Game Ontology Project (GOP) is creating a framework for describing, analyzing and games, by defining a hierarchy of concepts abstracted from an analysis of many specific games...
115
Voted
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
102
click to vote
DIGRA
2003
Springer
15 years 4 months ago
2003
Springer
This essay adopts a formal model of play as semiosis [18] to explore the often dysfunctional role of backstories within computer game design and play. Within this model, backstori...
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold'em poker. The first player, GS3, is designed for playing limit Texas Hold'em, in ...
CSL
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...