Author
Listed:
- Pathak, Shraddha
- Kulkarni, Ankur A.
Abstract
During an epidemic, the information available to individuals in the society deeply influences their belief of the true infectiousness of the disease, and thereby the preventive measures they take to stay safe from the infection. In this paper, we develop a scalable framework for ascertaining the optimal choice of the test for determining the infectiousness of the disease whose results must be truthfully communicated to individuals for the purpose of epidemic containment. We use a networked public goods model to capture the underlying societal structure and the individuals’ incentives during an epidemic, and the Bayesian persuasion framework for modelling the choice of the test. Our first main result is a structural decomposition of the government’s objectives into two independent components – a component dependent on the utility function of individuals, and another dependent on properties of the underlying network. Since the network dependent term in this decomposition is unaffected by the testing strategies adopted by the government, this characterization simplifies the problem of finding the optimal testing methodology. We find explicit conditions, in terms of certain concavity measures, under which perfectly accurate tests, uninformative tests, tests which exaggerate the infectiousness, and ones which downplay it are optimal. Furthermore, we explicitly evaluate these optimal tests for exponential and quadratic benefit functions and study their dependence on underlying parameter values. The structural decomposition results are also helpful in studying other forms of interventions like incentive design and network design.
Suggested Citation
Pathak, Shraddha & Kulkarni, Ankur A., 2025.
"A scalable Bayesian persuasion framework for epidemic containment on heterogeneous networks,"
Journal of Mathematical Economics, Elsevier, vol. 119(C).
Handle:
RePEc:eee:mateco:v:119:y:2025:i:c:s0304406825000515
DOI: 10.1016/j.jmateco.2025.103134
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:119:y:2025:i:c:s0304406825000515. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.