Multi-Item Auction Based Mechanism for Mobile Data Offloading: A Robust Optimization Approach
Bibliographic record
Abstract
The opportunistic utilization of access devices to offload mobile data from cellular network has been considered as a promising approach to cope with the explosive growth of cellular traffic. To foster this opportunistic utilization, we consider a mobile data offloading market where mobile network operator (MNO) can sell bandwidth made available by the access points (APs) to increase MNO's profit. We formulate the offloading problem as a multi-item auction and study MNO's profit maximization problem. We discuss the conditions to (i) offload the maximum amount of data traffic, (ii) foster the participation of mobile subscribers (MSs) (individual rationality), (iii) prevent market manipulation (incentive compatibility) and (iv) preserve budget feasibility of MSs. Then, we propose a robust optimization based method to implement multi-item auction mechanism. We further propose two iterative algorithms that efficiently solve the offloading problem. The simulation results show the efficiency and robustness of our proposed methods for cellular data offloading.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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".