1599 search results - page 68 / 320 » Algorithms for Parity Games |
105
click to vote
FSTTCS
2008
Springer
15 years 16 days ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
ACMACE
2005
ACM
15 years 5 months ago
2005
ACM
As smart players often win MMOG sessions by adopting frantic gaming strategies along the game evolution, also the system activities concerned with the distributed support of MMOGs...
113
click to vote
ICALP
2010
Springer
15 years 1 months ago
2010
Springer
We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided amon...
APPROX
2008
Springer
15 years 1 months ago
2008
Springer