Nash equilibrium seeking under partial-decision information: monotonicity, smoothness and proximal-point algorithms

We consider Nash equilibrium problems in a partial-decision information scenario, where each agent can only exchange information with some neighbors, while its cost function possibly depends on the strategies of all agents. We characterize the relation between several monotonicity and smoothness assumptions postulated in the literature....