We propose a new gradient based scheme to approximate Nash equilibria of large sequential two-player, zero-sum games. The algorithm uses modern smoothing techniques for saddle-point problems tailored specifically for the polytopes used in the Nash equilibrium problem.

We present convergence rate analysis for the approximate stochastic gradient method, where individual gradient updates are corrupted by computation errors. We develop stochastic quadratic constraints to formulate a small linear matrix inequality (LMI) whose feasible set characterizes convergence properties of the approximate stochastic gradient. Based on this LMI condition, we develop a sequent...

Approximate string matching is a sequential problem and therefore it is possible to solve it using nite automata. Nondeterministic nite automata are constructed for string matching with k mismatches and k di erences. The corresponding deterministic nite automata are base for approximate string matching in linear time. Then the space complexity of both types of deterministic automata is calculat...

For module algebras and module coalgebras over an arbitrary bialgebra, we define two types of bivariant cyclic cohomology groups called bivariant Hopf cyclic cohomology and bivariant equivariant cyclic cohomology. These groups are defined through an extension of Connes’ cyclic category Λ. We show that, in the case of module coalgebras, bivariant Hopf cyclic cohomology specializes to Hopf cyclic...

Inspired by [3] we introduce the concept of extended Hopf algebra and consider their cyclic cohomology in the spirit of Connes-Moscovici [3, 4, 5]. Extended Hopf algebras are closely related, but different from, Hopf algebroids. Their definition is motivated by attempting to define cyclic cohomology of Hopf algebroids in general. Many of Hopf algebra like structures, including the Connes-Moscov...