Transmission control in cognitive radio systems with latency constraints as a switching control dynamic 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 addresses the secondary user rate adaptation problem in cognitive radio networks. By modeling primary user activities and secondary user block fading channels as finite state Markov chains, we formulate the transmission rate adaptation problem of each secondary user as a zero-sum dynamic Markovian game with a delay constraint. The Nash equilibrium of the resulting game is available and all of the Nash equilibria have a unique value vector. Conditions are given so that the Nash equilibrium transmission policy of each user is a randomized mixture of pure threshold policies. Such threshold policies are easily implementable. Finally, we present a stochastic approximation algorithm which can adaptively estimate Nash equilibrium policies and track such policies for non-stationary problems where the statistics of the channel and user parameters evolve with time.
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