Global Convergence of An Iterative Gradient Algorithm for The Nash Equilibrium in An Extended OSNR Game
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper considers the problem of optical signal-to-noise ratio (OSNR) optimization with link capacity constraints within a Nash game framework. In optical wavelength-division multiplexed (WDM) networks, all wavelength-multiplexed channels share the optical fiber. Even when individually channel parameters are adjusted, the total launched power has to be limited below the nonlinearity threshold. This can be regarded as the optical link capacity constraint. In the previous work of Pan & Pavel (2005), the authors have proposed an extended OSNR Nash game. Channel utility has been related to OSNR and the status of the optical link has been considered directly in channel cost function. The difficulty is that the unique Nash equilibrium (NE) solution of this OSNR Nash game is highly nonlinear and thus analytically intractable. The main contribution of this paper is to develop an iterative, distributed gradient algorithm towards finding the NE solution. The algorithm uses only local measurements and the current load of the network (or link). The authors proved that the iterative gradient algorithm converges globally to this NE solution under sufficient conditions.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it