Skip to content
Preprint

Sparse One-Step-Ahead Optimal Control of Time-Varying Affine Opinion Networks: Tracking and Competitive Games

Sep 2026 · 0 citations · 19 references
Engineering Computer Science

Abstract

This paper studies resource-limited external influence in time-varying opinion networks when a controller must choose both a small set of agents and a scalar intervention at each update. We use the affine free response, which includes DeGroot and Friedkin--Johnsen dynamics, followed by a direct sparse action. Eliminating the scalar action reduces the one-step problem to a cardinality-constrained support objective whose global optimum is obtained from the largest or smallest residual components. Hence exact sparse one-step-ahead optimal control requires one sort and \(O(|\mathcal T|\log|\mathcal T|)\) operations, where \(\mathcal T\) is the support set. For periodic affine dynamics, the resulting state-dependent low-rank feedback admits cycle-based ultimate bounds and exact tracking of model-invariant targets. The DeGroot and Friedkin--Johnsen specializations expose the role of target invariance and the affine mismatch term. With several competing external players, each sparse best response retains the same sorting structure and the complete binary--continuous stage game is an exact potential game, so a pure-strategy equilibrium exists at every frozen state. Same-state welfare benchmarks separate loss due to scalar competition from the additional loss due to strategic support selection. Numerical examples validate exact support selection and illustrate switching-order effects, DeGroot/Friedkin--Johnsen tracking, resource tradeoffs, and competitive implementations.

View source

Similar papers

Preprint Aug 2026

Competitive One-Step-Ahead Control of Friedkin--Johnsen Networks: Potential Games, Stability, and the Price of Competition

This paper studies competitive one-step-ahead control of Friedkin-Johnsen networks with overlapping player influence. The one-step interaction is an exact potential game with a unique Nash equilibrium obtained from a symmetric positive-definite system. Sequential best-response sweeps converge for every frozen network s...

G. Gentil, Amit Bhaya · 1 citation
Preprint Aug 2026

Stochastic Gradient Tracking over Time-Varying Networks: One-Step Lyapunov Analysis

A time-varying quadratic norm is constructed that turns this window contraction into an exact one-step Lyapunov identity, leading to coupled one-step recursions for the centroid and disagreement errors, without unrolling the dynamics over communication windows.

Sulaiman A. Alghunaim · 0 citations
Preprint Sep 2026

Structured Positive-Definite Optimal Control Synthesis of Closed-Loop Recommendation Systems over Social Networks

We study the design of feedback recommendation policies for networked multi-topic opinion dynamics. The design of recommendations is formulated as an infinite-horizon linear-quadratic optimal control problem that favors suggestions aligned with each agent's current opinion, thereby using opinion alignment as a proxy fo...

Simone Mariano, Paolo Frascà · 0 citations
Preprint Aug 2026

Projection-Free Bandit Online Optimization for Multi-Agent Systems with Dynamic Regret

This paper proposes a distributed bandit online feedback optimization algorithm that relies solely on real-time input-output data and establishes a sublinear dynamic regret bound that depends on a temporal variation measure of system non-stationarity.

Xia Jiang, Lu Liu, Gang Feng · 0 citations
Preprint Sep 2026

Critic-Free Policy Iteration for Continuous-Time Zero-Sum Games: A Policy-Space Riccati Approach

This paper develops a critic-free policy iteration (PI) method for continuous-time linear zero-sum games. The central idea is to characterize the saddle-point policies directly in the joint policy space, rather than treating the quadratic value matrix as an iterative variable. A policy game Riccati equation (PGRE) is i...

Jia-Cheng Wu, Yang Zhu, Hong-Ye Su · 0 citations
Preprint Sep 2026

Gradient-Only Online Convex Optimization with a Single Quadratic Leader

We study online convex optimization on a bounded Euclidean domain when the learner receives only one subgradient at its prediction and knows neither the horizon, a gradient bound, nor the losses'strong-convexity parameters. We present a scale-invariant algorithm that couples projected adaptive gradient descent to one c...

Kamiar Asgari · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.