192 search results - page 14 / 39 » Realization theory of Nash systems |
ATAL
2011
Springer
12 years 9 months ago
2011
Springer
The field of multiagent decision making is extending its tools from classical game theory by embracing reinforcement learning, statistical analysis, and opponent modeling. For ex...
LATA
2010
Springer
14 years 6 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
ITP
2010
14 years 26 days ago
2010
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to ...
HYBRID
2010
Springer
13 years 11 months ago
2010
Springer
In this paper we study the identifiability of linear switched systems (LSSs ) in discrete-time. The question of identifiability is central to system identification, as it sets the...