1698 search results - page 52 / 340 » Growing Complex Games |
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
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...
JAIR
2010
14 years 8 months ago
2010
Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than...
FORMATS
2010
Springer
14 years 7 months ago
2010
Springer
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
114
click to vote
ACSC
2010
IEEE
14 years 4 months ago
2010
IEEE
One of the major challenges facing a present day game development company is the removal of bugs from such complex virtual environments. This work presents an approach for measuri...