89 search results - page 8 / 18 » Admissibility in Infinite Games |
SIAMCO
2008
13 years 7 months ago
2008
Abstract. In this paper we consider a class of hybrid stochastic games with the piecewise openloop information structure. These games are indexed over a parameter which represents...
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
We study the problems of existence and construction of infinite schedules for finite weighted automata and one-clock weighted timed automata, subject to boundary constraints on the...
EURONGI
2006
Springer
13 years 11 months ago
2006
Springer
This is a framework for resource allocation in a heterogeneous system composed of various access networks, for instance Third Generation wireless networks (3G) and WLAN, in the pre...
ESAW
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We study the problem of checking the competence of communicative agents operating in a global society in order to receive and offer electronic services. Such a society wi...
AAAI
2010
13 years 9 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...