Joint Mode Selection and Spectrum Partitioning for Device-to-Device Communication: A Dynamic Stackelberg Game
Bibliographic record
Abstract
Device-to-device (D2D) communication technology is a promising add-on component for future wireless networks to provide local area services with increased spectrum efficiency and improved user experience. Three modes (i.e., cellular mode, reuse mode, and dedicated mode) can be used for D2D communication. A potential D2D user equipment (UE) can select a communication mode and dynamically adapt the mode selection according to the performance and the cost. This is referred to as the user-controlled mode selection problem. Also, a base station (BS) needs to reserve a spectrum band for the dedicated mode of operation, which we refer to as spectrum partitioning. The optimal spectrum partitioning needs to consider the utility of the BS that depends on the distribution of the users' mode selection, which, in turn, is governed by the spectrum partitioning. To jointly address the problems of spectrum partitioning and user-controlled mode selection (which are cyclically dependent on each other), we propose a dynamic Stackelberg game framework in which the BS and the potential D2D UEs act as the leader and the followers, respectively. Specifically, the adaptive mode selection of potential D2D UEs is formulated as a follower evolutionary game, and an evolutionary stable strategy is considered to be the solution. The dynamic control of spectrum partitioning by the BS is formulated as a leader optimal control problem. We also extend the formulation by considering information delays in control and state. Numerical analysis is performed to evaluate the effectiveness of the proposed framework, which shows that although the mode selection is performed in a distributed and user-controlled manner, the dynamic spectrum partitioning can be viewed as an effective incentive mechanism to drive the user distribution close to the optimal one.
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.003 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".