Collaborative Security in Vehicular Cloud Computing: A Game Theoretic View
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
Connected vehicular cloud computing (CVCC) is a promising paradigm that utilizes the rich resources of connected cars. However, it also introduces new cyber-attack surfaces that may compromise the security or privacy of the vehicles. In reality, security in vehicular cloud computing lies in the willingness of vehicle owners who are concerned with their vehicles' protection from various threats. Increasing the participation of vehicles will improve the security in vehicular cloud computing as a whole. Therefore, for a CVCC service provider, it is very critical to encourage vehicle owners to invest in their own security for achieving deeper security of CVCC systems. In this article, we first present a CVCC architecture and its applications. Then we study several security issues in vehicular cloud computing. Afterward, we model a CVCC network by a two-phase heterogeneous public good game, and then investigate the influence of different incentive mechanisms and the structure of a complex network describing the vehicles' connectivity on the vehicles' investment rate. Finally, we present our conclusion.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 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