This paper proposes a novel approach for computing an approximate equilibrium in a game of imperfect information. Our approach involves decomposition; that is, breaking the problem down into subproblems that can be solved independently. We compare our approach to other decomposition approaches, and illustrate that our approach is guaranteed to find an equilibrium when applied to the recovery pr...

For the feature analysis of vector fields we decompose a given vector field into three components: a divergence-free, a rotation-free, and a harmonic vector field. This Hodgetype decomposition splits a vector field using a variational approach, and allows to locate sources, sinks, and vortices as extremal points of the potentials of the components. Our method applies to discrete tangential vect...

Real-time road traffic control has been the subject of active research efforts for more than fifty years. In recent years, however, the convergence of ubiquitous sensing with seamless communication technologies has motivated the development of more computationally efficient control methods, able to operate in real-time in a live environment. In this work, we present a fast decomposition method ...

A vector equilibrium problem is generally defined by a bifunction which takes values in a partially ordered vector space. In particular, when this space is endowed with a componentwise ordering, the vector equilibrium problem can be decomposed into a family of equilibrium subproblems, each of them being governed by a bifunction obtained from the initial one by selecting some of its scalar compo...

In many situations of hydrodynamic phenomenon, two-layer fluid is a dominant feature of fluid motion. Such two-layer fluid often contains jumps in the density across the interface of fluid domains. The interface of air and water or salt water and fresh water is obvious example [Tho68]. The density jump may be assumed to occur in an infinitesimally thin interface in the mixture. And, the behavio...

in this paper, a local approach to the concept of hudetz $g$-entropy is presented. the introduced concept is stated in terms of hudetz $g$-entropy. this representation is based on the concept of $g$-ergodic decomposition which is a result of the choquet's representation theorem for compact convex metrizable subsets of locally convex spaces.

I consider the problem of decomposing a time series into its constituent components. In general, this is underdetermined, and assumptions must be made. Previous attempts include applying nonnegative matrix factorization to the spectrograms of isolated sources to learn a basis for each. A new time series composed of a sum of these sources is then projected onto these bases. For this project, I a...

Abstract. A scalable architecture to facilitate emergent (self-organized) task decomposition using neural networks and evolutionary algorithms is presented. Various control system architectures are compared for a collective robotics (3 × 3 tiling pattern formation) task where emergent behaviours and effective task -decomposition techniques are necessary to solve the task. We show that bigger, m...