Given general quasi-differential expressions , each of order n with complex coefficients and their formal adjoint are on the interval [a,b) respectively, we give a characterization all regularly solvable operators adjoints generated by ordinary expression in direct sum Hilbert spaces . The domains these described terms boundary conditions involving -solutions equations intervals [ap,bp). This i...

Multi-agent reinforcement learning (MARL) is often modeled using the framework of Markov games (also called stochastic or dynamic games). Most existing literature on MARL concentrates zero-sum but not applicable to general-sum games. It known that best response dynamics in are a contraction. Therefore, different equilibria can have values. Moreover, Q-function sufficient completely characterize...

Zero-sum stochastic games are easy to solve as they can be cast as simple Markov decision processes. This is however not the case with general-sum stochastic games. A fairly general optimization problem formulation is available for general-sum stochastic games by Filar and Vrieze [2004]. However, the optimization problem there has a non-linear objective and non-linear constraints with special s...