Evidence map›Paper›PMID 33583996›Full record

ArticleJournal of mathematical economics2021

Social interactions and the prophylaxis of SI epidemics on networks.

Géraldine Bouveret, Antoine Mandel

Open access · greenAbstract read
In one paragraph

Article in Journal of mathematical economics, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
1.3field-weighted citation impact, top 20% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed, 10 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors at 2 institutions in 2 countries.

Géraldine BouveretNanyang Technological University, School of Physical and Mathematical Sciences, 21 Nanyang Link, 637371, Singapore.
Antoine MandelParis School of Economics-Université Paris 1 Panthéon-Sorbonne, Centre d'Économie de la Sorbonne, 106 Boulevard de l'hôpital, 75013, Paris, France.
Centre d'Économie de la Sorbonne · FRNanyang Technological University · SG

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

We investigate the containment of epidemic spreading in networks from a normative point of view. We consider a susceptible/infected model in which agents can invest in order to reduce the contagiousness of network links. In this setting, we study the relationships between social efficiency, individual behaviours and network structure. First, we characterise individual and socially efficient behaviour using the notions of communicability and exponential centrality. Second we show, by computing the Price of Anarchy, that the level of inefficiency can scale up linearly with the number of agents. Third, we prove that policies of uniform reduction of interactions satisfy some optimality conditions in a vast range of networks. In setting where no central authority can enforce such stringent policies, we consider as a type of second-best policy the implementation of cooperation frameworks that allow agents to subsidise prophylactic investments in the global rather than in the local network. We then characterise the scope for Pareto improvement opened by such policies through a notion of Price of Autarky, measuring the ratio between social welfare at a global and a local equilibrium. Overall, our results show that individual behaviours can be extremely inefficient in the face of epidemic propagation but that policy can take advantage of the network structure to design welfare improving containment policies.

Indexed as

Epidemic spreadingNetworkPrice of AnarchyPublic good

Identifiers

PMID33583996
PMCPMC7863793
OpenAlexW3128228982

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.