Sciweavers

5995 search results - page 174 / 1199
» Algorithmic Game Theory
Sort
View
FSTTCS
2008
Springer
15 years 5 months ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn
AGI
2008
15 years 5 months ago
Adversarial Sequence Prediction
Sequence prediction is a key component of intelligence. This can be extended to define a game between intelligent agents. An analog of a result of Legg shows that this game is a co...
Bill Hibbard
111
Voted
IPL
2006
92views more  IPL 2006»
15 years 3 months ago
A constructive approach to sequential Nash equilibria
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
René Vestergaard
ENDM
2010
87views more  ENDM 2010»
15 years 4 months ago
Euler Complexes (Oiks)
We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence...
Jack Edmonds
121
Voted
CIG
2006
IEEE
15 years 10 months ago
Fun in Slots
— People play games for fun. Yet we are lacking a fundamental understanding of what fun is and how fun works in games and other media. For example, why do thousands of people spe...
Kevin Burns