Pricing, Spectrum Sharing, and Service Selection in Two-Tier Small Cell Networks: A Hierarchical Dynamic Game Approach
Bibliographic record
Abstract
Small cells overlaid with macrocells can increase the capacity of two-tier cellular wireless networks by offloading traffic from macrocells. To motivate the small cell service providers (SSPs) to open portion of the access opportunities to macro users (i.e., to operate in a hybrid access mode), we design an incentive mechanism in which the macrocell service provider (MSP) could pay to the SSPs. According to the price offered by the MSP, the SSPs decide on the open access ratio, which is the ratio of shared radio resource for macro users and the total amount of radio resource in a small cell. The users in this two-tier network can make service selection decisions dynamically according to the performance satisfaction level and cost, which again depend on the pricing and spectrum sharing between the MSP and SSPs. To model this dynamic interactive decision problem, we propose a hierarchical dynamic game framework. In the lower level, we formulate an evolutionary game to model and analyze the adaptive service selection of users. An evolutionary stable strategy (ESS) is considered to be the solution of this game. In the upper level, the MSP and SSPs sequentially determine the pricing strategy and the open access ratio, respectively, taking into account the distribution of dynamic service selection at the lower-level evolutionary game. A Stackelberg differential game is formulated where the MSP and SSPs act as the leader and followers, respectively. An open-loop Stackelberg equilibrium is considered to be the solution of this game. We also extend the hierarchical dynamic game framework and investigate the impact of information delays on the equilibrium solutions. Numerical results show the effectiveness and advantages of dynamic control of the open access ratio and pricing.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 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.002 |
| 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".