1698 search results - page 38 / 340 » Growing Complex Games |
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
We study coalitional games where the value of cooperation among the agents are solely determined by the attributes the agents possess, with no assumption as to how these attribute...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a ge...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
In the course of the recent complexification and sophistication of commercial computer games, the creation of competitive artificial players that are able to behave intelligentl...
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...