MétaCan
Menu
Back to cohort
Record W2740451416 · doi:10.1109/icc.2017.7997224

Stackelberg game approach for wireless virtualization design in wireless networks

2017· article· en· W2740451416 on OpenAlexaff
Thinh Duy Tran, Long Bao Le

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsInstitut National de la Recherche ScientifiqueUniversité du Québec à Montréal
Fundersnot available
KeywordsStackelberg competitionComputer scienceWireless networkWirelessVirtualizationComputer networkResource allocationTelecommunications linkNash equilibriumGame theoryTelecommunicationsMathematical optimizationCloud computingEconomics

Abstract

fetched live from OpenAlex

We propose a wireless virtualization framework based on the Stackelberg game model for resource allocation in downlink orthogonal frequency division multiple access (OFDMA) wireless networks. Specifically, the wireless virtualization model enables an infrastructure provider (InP) to effectively lease radio resources to multiple mobile virtual network operators (MVNOs) through adaptively setting resource prices whereas the MVNOs selfishly optimize the resource allocation to maximize their utilities. The Stackelberg game approach is employed to solve the underlying hierarchical problems where the InP acts as a leader while the MVNOs play the roles of the followers. In particular, we derive the Stackelberg equilibrium (SE), at which no player has incentive to deviate unilaterally. Extensive numerical results are presented to confirm the efficacy of our proposed framework in balancing the achievable utilities of the InP and MVNOs compared to other traditional pricing schemes.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.977
Threshold uncertainty score0.536

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.079
GPT teacher head0.307
Teacher spread0.228 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations18
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207