Incentive Mechanism for Cached-Enabled Small Cell Sharing: A Stackelberg Game Approach
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
In this paper, we study a small-cell caching system consisting of one privately-owned small base station (SBS) and multiple content providers (CPs), where CPs leverage the caching capabilities of SBSs to efficiently provide content delivery service to mobile subscribers. Specifically, an incentive cache mechanism is proposed, to stimulate the privately- owned SBS and CPs to participate in the caching system. A two-stage Stackelberg game is formulated for the interaction between the SBS and CPs. In the first stage, the private SBS first decides the price policy to maximize the profit. In the second stage, according to the charge price, each CP determines the amount of caching storage to maximize its utility. The impact of transmission congestion on CP utility is also taken into consideration, which also influences CPs' decisions. We prove the existence and uniqueness of the equilibrium, and design an optimal pricing algorithm to maximize the SBS's revenue. Simulation results are provided to evaluate the performance of the proposed mechanism, which demonstrates the efficiency and feasibility on the SBS resource sharing.
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.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| 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