China's Railway Transportation Safety Regulation System Based on Evolutionary Game Theory and System Dynamics
Bibliographic record
Abstract
China's railways were restructured in 2013. The number of regulatory practitioners has decreased significantly, making real-time regulation more difficult. Regulatory transfers from inside to outside the railway industry increases information risks. A more reasonable regulation mechanism is needed. The article considers introducing a public supervision mechanism into the railway transportation safety regulation system, which includes two regulators and one regulatee. As the government regulator, the State Railway Administration (SRA) regulates the safety of China Railway Corporation (CR) and encourages the public to act as supervisors to expose the CR's unsafe production information. To analyze the risks and effectiveness of the system, a multiplayer evolutionary game and system dynamics-based model for railway transportation safety regulation is established. The decision processes of players under different conditions are simulated. The results show that improving the public supervision ratio is conducive to improve the CR's safe production ratio. However, there is no evolutionarily stable strategy (ESS) in the system. Strategies and evolutionary processes have large fluctuations, which represent high risk. Excessive penalty and reward coefficients can aggravate the amplitude and frequency of fluctuations, causing uncertainty in regulation and making it more difficult to control the actual problems. A dynamic reward and punishment mechanism is proposed to control these fluctuations. The system finally achieves an ESS that results in the lowest regulation investment for the SRA, a safe production ratio for the CR of 95%, and a public supervision ratio of 95.2%. Introducing public supervision and dynamic reward and punishment mechanisms help to stabilize and improve the CR's safe production ratio and to decrease the SRA's regulatory investment.
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.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.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".