Incentive Mechanism for P2P Networks Based on Feature Weighting and Game Theory
Bibliographic record
Abstract
There are mainly three types of problems in Peer-to-Peer (P2P) networks such as free-riding nodes, group deception, and node bias.To solve this, the authors proposed an incentive mechanism for the P2P networks based on feature weighting and game theory.The mechanism first used the five comprehensive coefficients of node degree, node clustering coefficient, local clustering coefficient, all clustering coefficients, and correlation coefficients to form a feature clustering matrix through linear fusion; then, in order to maximize the overall revenue, a sparse matrix of revenue was generated through feature classification, noise reduction, mapping and iteration, highlighting the status of fully cooperative nodes; afterwards, combining group evolution and constraint rule sets, the authors determined group node dynamic adjustment rules, response service rules, and message query and forwarding rules, to maximize service efficiency; finally, a multilayered P2P dynamic service system was constructed to promote the active evolution of nodes, and avoid the negative migration.The simulation experiment was also performed to verity this mechanism.The research findings provide an effective idea for stimulating node behaviors, reducing negative node migration, and excellent node selection.
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.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".