A Multi-Leader Multi-Follower Game-Based Analysis for Incentive Mechanisms in Socially-Aware Mobile Crowdsensing
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
The mobile crowdsensing paradigm facilitates a broad range of emerging sensing applications by leveraging ubiquitous mobile users to cooperatively perform certain sensing tasks with their smart devices. As this paradigm involves data collection from users, the issue of designing rewards to incentivize users is fundamentally important to ensure participation in crowdsensing. In this paper, we revisit this issue in the context of socially-aware crowdsensing which integrates crowdsensing into social networks. For example, in healthcare-based crowdsensing services, the fun of tracking daily nutrition information for a certain user can be promoted by comparing her nutritional information with that contributed and shared by her socially-connected friends. To be more general and practical, we study the incentive mechanisms in presence of multiple crowdsensing service providers and multiple users. Understanding the behaviors of users and service providers in socially-aware crowdsensing is of paramount importance for incentive mechanisms. With this focus, we propose a multi-leader and multi-follower Stackelberg game approach to model the strategic interactions among service providers and users, where the social influence of users and the strategic interconnections of service providers are jointly and formally integrated into the game modeling. Through backward induction methods, we theoretically prove the existence and uniqueness of the Stackelberg equilibrium. We conduct extensive simulations to investigate game equilibrium properties, and the real-world dataset is applied to evaluate and demonstrate the performance effectiveness of the proposed game model.
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.001 | 0.001 |
| Bibliometrics | 0.000 | 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.001 |
| 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