G<scp>lobal</scp>S<scp>ecurity</scp>P<scp>olicies against</scp>T<scp>errorism and the</scp>F<scp>ree</scp>R<scp>iding</scp>P<scp>roblem</scp>: A<scp>n</scp>E<scp>xperimental</scp>A<scp>pproach</scp>
Bibliographic record
Abstract
Abstract The World Trade Center attack has shed light on the urgent need to implement preventing measures against terrorism and to enhance cooperation in the global security system for all countries. However, international coordination cannot be taken for granted. It is often ineffective and likely to fail for several reasons. Perhaps the more prominent reason to explain failure in coordination is that collective actions against terrorism may suffer from the well‐known free riding problem. In this paper we experimentally investigate cooperation dilemma in counterterrorism policies by measuring to what extent international deterrence policy may suffer from free riding. In our game, contributions to the group account do not aim to increase the production of the public good but instead seek to decrease the probability that a stochastic event destroys the good. A country could choose to free ride by investing nothing in the international deterrence policy and instead invest all its resources in its own national protection or even choose to ignore totally terrorism by investing on alternative projects. We also look at the effects of institutions that allow sanctioning and rewarding of other countries to facilitate coordination on deterrence policy. We find that, in absence of institutional incentives and after controlling for risk aversion, most of countries defect by investing very weakly in collective actions against terrorism while largely investing to protect themselves. In contrast, the introduction of punishment/reward incentive systems improves significantly the contribution level to the collective security account.
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.003 | 0.011 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.050 | 0.004 |
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".