This paper investigates value function approximation in the context of zero-sum Markov games, which can be viewed as a generalization of the Markov decision process (MDP) framework to the two-agent case. We generalize error bounds from MDPs to Markov games and describe generalizations of reinforcement learning algorithms to Markov games. We present a generalization of the optimal stopping probl...

This paper presents a generalization of observer/Kalman filter identification (OKID). OKID is a method for the simultaneous identification of a linear dynamical system and the associated Kalman filter from input-output measurements corrupted by noise. OKID was originally developed at NASA as the OKID/ERA algorithm. Recent work showed that ERA is not the only way to complete the OKID process and...

This paper studies the semantics of discrete-event systems as a concurrent model of computation. The classical approach, which is based on metric spaces, does not handle well multiplicities of simultaneous events, yet such simultaneity is a common property of discrete-event models and modeling languages. (Consider, for example, delta time in VHDL.) In this paper, we develop a semantics using an...

Increasing complexity of the modern market dynamics requires new quantitative frameworks for the discovery of stable portfolio strategies. Important requirements include the ability of the coupled and self-consistent optimization of the dynamic strategies and asset allocations as well as robust built-in mechanisms for the strategy complexity control to ensure acceptable out-of-sample performanc...

K. Mehlhorn introduced a class of polynomial time computable operators in order to study poly time reducibilities between functions. This class is deened using a generalization of A. Cobham's deenition of feasibility for type 1 functions to type 2 functionals. Cobham's feasible functions are equivalent to the familiar poly time functions. We generalize this equivalence to type 2 functionals. Th...

Grove and Halperin [3] introduced a notion of taut immersions. Terng and Thorbergsson [5] give a slightly different definition and showed that taut immersions are a simultaneous generalization of taut immersions of manifolds into Euclidean spaces or spheres, and some interesting embeddings constructed by Bott and Samelson [1]. They go on to prove many theorems about such immersions. One particu...

the concept of  -semihypergroups is a generalization of semigroups, a generalization of semihypergroups and a generalization of  -semigroups. in this paper, we study the concept of semiprime ideals in a  -semihypergroup and prove some results. also, we introduce the notion of  -hypergroups and closed  -subhypergroups. finally, we study the concept of  -semihypergroups associated to binary...

Generalization, i.e., the ability of solving problem instances that are not available during system design and development phase, is a critical goal for intelligent systems. A typical way to achieve good generalization learn model from vast data. In context heuristic search, such paradigm could be implemented as configuring parameters parallel algorithm portfolio (PAP) based on set “training” i...

we prove that the class of profinite groups $g$ that have a factorization $g=ab$ with $a$ and $b$ abelian closed subgroups, is closed under taking strict projective limits. this is a generalization of a recent result by k.h.~hofmann and f.g.~russo. as an application we reprove their generalization of iwasawa's structure theorem for quasihamiltonian pro-$p$ groups.