Dependency-aware Task Offloading and Resource Pricing in Vehicular Edge Computing: A Stackelberg Game Approach
Bibliographic record
Abstract
Vehicular Edge Computing (VEC) allows vehicles to offload their delay-sensitive tasks to nearby Road Side Units (RSUs) for processing, which improves network quality of service (QoS). However, the self-interested SDN controller is unwilling to ask RSUs to provide free computing resources for vehicles. At the same time, complicated dependencies between vehicular subtasks may cause non-ideal task delay and energy consumption. In order to solve these problems, this paper proposes a Stackelberg game-based Dependency-aware task Offloading and resource Pricing framework (SDOP). Specifically, we first model a vehicular edge network that partially offloads dependency-aware tasks. Then, we depict the interaction between the SDN controller and vehicles as a Stackelberg game, with the goal of maximizing the utility of both parties. Next, we present a Gradient Ascent Plus Genetic algorithm (GAPG) to solve the problem. Finally, numerous simulations are performed, and the results show that compared with other baseline schemes, the proposed GAPG can significantly improve the utility of both the SDN controller and vehicles under various scenarios.
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 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".