Complexity and state-transitions in social dependence networks.
The aim of the present paper is twofold. On one hand, we present a classification of infinitesimal symmetries for Lagrangian systems, and the corresponding Noether theorems. The derivation of the result is made by using the symplectic techniques. Some of the results were previously obtained by other authors (see Prince (1985) for instance), and an exhaustive presentation can be found in de León and Martín de Diego (1995, 1996). Let us note that these results are true even if the Lagrangian function...
This paper proposes a distributed accelerated first-order continuous-time algorithm for convergence to Nash equilibria in a class of two-subnetwork zero-sum games with bilinear couplings. First-order methods, which only use subgradients of functions, are frequently used in distributed/parallel algorithms for solving large-scale and big-data problems due to their simple structures. However, in the worst cases, first-order methods for two-subnetwork zero-sum games often have an asymptotic or convergence....
This paper is concerned with solving the distributed resource allocation optimization problem by multi-agent systems over undirected graphs. The optimization objective function is a sum of local cost functions associated to individual agents, and the optimization variable satisfies a global network resource constraint. The local cost function and the network resource are the private data for each agent, which are not shared with others. A novel gradient-based continuous-time algorithm is proposed...
We survey recent papers on the problem of backward dynamics in economics, providing along the way a glimpse at the economics perspective, a discussion of the economic models and mathematical tools involved, and a list of applicable literature in both mathematics and economics.