Two-player zero-sum stochastic games with finite state and action spaces, as well as two-player zero-sum absorbing games with compact metric action spaces, are known to have undiscounted values. We study such games under the assumption that one or both players observe the actions of their opponent after some time-dependent delay. We develop criteria for the rate of growth of the delay such that...

In a repeated game with perfect monitoring, correlation among a group of players may evolve in the common course of play (online correlation). Bounds on the complexity of the strategies that players use may enable a group of players to conceal such a correlation from their opponent. The feasibility of such “online concealed correlation” is quantified by the individually rational payoff of the o...

In this paper, a general framework is proposed for the analysis and characterization of observability and diagnosability of finite state systems. Observability corresponds to the reconstruction of the system’s discrete state, while diagnosability corresponds to the possibility of determining the past occurrence of some particular states, for example faulty states. A unifying framework is propos...

State Machine (ASM) Specification of Embedded Control Systems: Documentation and Validation

We present a goal recognizer that statistically recognizes hierarchical goal schemas and their corresponding parameter values. The recognizer is fast (quadratic in the number of possible goal schemas and observations so far), and also supports partial parameter and subgoallevel prediction as well as n-best prediction.

We consider the following problem: given that a finite automaton M of N states accepts at least one k-power-free (resp., overlapfree) word, what is the length of the shortest such word accepted? We give upper and lower bounds which, unfortunately, are widely separated.