There exists a Nash equilibrium (-Nash equilibrium) for every n-person stochastic game with a finite (countable) state space and finite action sets for the players if the payoff to each player i is one when the process of states remains in a given set of states Gi and is zero otherwise.

The problem of curve clustering when curves are misaligned is considered. A novel algorithm is described, which jointly clusters and aligns curves. The proposed procedure efficiently decouples amplitude and phase variability; in particular, it is able to detect amplitude clusters while...

We define a reinforced stochastic process of random variables indexed by the vertices of a k-tree and with values in a Polish space. The work presents a natural extension from an exchangeable to a partially exchangeable setting of previous work done by the authors.