Static output feedback strategy for mean-field social control with nonlinear stochastic dynamics
Bibliographic record
Abstract
A mean-field social control problem for uncertain nonlinear stochastic systems is investigated by using a robust static output feedback (SOF) strategy. First, the problem in the single decision maker case is investigated in terms of guaranteed cost control approaches to derive suboptimal conditions at the supremum of the cost function. The Karush-Kuhn-Tucker (KKT) condition is used to derive the necessary conditions which are expressed as a large stochastic combined matrix equation (SCME). Second, the preliminary results in the single decision maker case are used to study the Pareto optimal strategy in a cooperative game. As our main contribution, we derive the high-order centralised strategies and the low-order decentralised strategies, respectively, for the cooperative game. In order to avoid the difficulty of higher-order dimensional problem related to SCMEs, a new reduced-order decomposition numerical scheme by means of Newton's method is developed. The computation for designing the proposed strategy set can be performed in low dimension, even when the number of decision makers approachs to infinity. Moreover, the degradation of the cost function is rigorously evaluated by comparing the centralised strategy set with the proposed strategy set. Finally, several numerical experiments are conducted to demonstrate the usefulness and effectiveness of the proposed strategy set.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".