In this article, we study proximal type dynamics in the context of multiagent network games.
We analyze several conjugations of this class of games, providing convergence results …

We introduce a novel definition of monotonicity, termed “type-K” in honor of Kamke, and
study nonlinear type-K monotone dynamical systems possessing the plus-subhomogeneity …

Comments on “Distributed robust adaptive equilibrium computation for generalized convex
games” [Automatica 63 (2016) 82–91] - ScienceDirect Skip to main contentSkip to article …

We consider generalized Nash equilibrium (GNE) problems under a partial-decision
information regime, in which each agent typically reconstructs the opponents' strategies …

This letter leverages a framework based on averaged operators to tackle the problem of
tracking fixed points associated with maps that evolve over time. In particular, this letter …

Distributed decision making in multi-agent networks has recently attracted significant
research attention thanks to its wide applicability, eg in the management and optimization of …

State convergence is essential in many scientific areas, eg multi-agent consensus/
disagreement, distributed optimization, computational game theory, multi-agent learning …

A network game is a collection of inter-dependent optimization problems associated with self-
interested decision makers, or agents, connected via a network structure, where each agent …

The growing complexity and globalization of modern society brought to light novel problems
and challenges for researchers that aim to model real-life phenomena. Nowadays …