1599 search results - page 46 / 320 » Algorithms for Parity Games |
120
click to vote
FOSSACS
2009
Springer
15 years 6 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
SIGECOM
2010
ACM
14 years 11 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
COLT
1995
Springer
15 years 2 months ago
1995
Springer
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
86
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
103
click to vote
WINE
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We study safety level coalitions in competitive games. Given a normal form game, we define a corresponding cooperative game with transferable utility, where the value of ...