Smart Dynamic Pricing and Cooperative Resource Management for Mobility-Aware and Multi-Tier Slice-Enabled 5G and Beyond Networks
Bibliographic record
Abstract
In this paper, we propose a novel cooperative resource sharing technique in multi-tier edge slicing networks which is robust to imperfect channel state information (CSI) caused by user equipments’ (UEs) mobility. Due to the mobility of UEs, the dynamic requirements of their tasks, and the limited resources of the network, we propose a smart joint dynamic pricing and resources sharing (SJDPRS) scheme that can incentivize the infrastructure provider (InP) and mobile network operators (MNOs). Aiming to maximize the profits of UEs, MNOs and the InP under the task fulfillment constraints, we formulate an optimization problem by deploying the multi-objective optimization method where in addition to the resource allocation variables, the price values are also the optimization variables. To solve the problem, we adopt a new deep reinforcement learning (DRL) method based on a carefully designed reward function. The simulation results indicate that the proposed resource sharing scenario can increase total profits for the UEs, MNOs, and InP in comparison to non-cooperative case, while also providing almost complete fairness among the players. In particular, as compared to the baselines and benchmarks, the profits for each network component (MNO, InP, and UEs), under fairness considerations, are enhanced by 75%, 79%, and 76%, respectively.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".