Allocating Stimulus Checks in Times of Crisis

06/14/2021
by   Marios Papachristou, et al.
0

We study the problem of allocating bailouts (stimulus, subsidy allocations) to people participating in a financial network subject to income shocks. We build on the financial clearing framework of Eisenberg and Noe that allows the incorporation of a bailout policy that is based on discrete bailouts motivated by the types of stimulus checks people receive around the world as part of COVID-19 economical relief plans. We show that optimally allocating such bailouts on a financial network in order to maximize a variety of social welfare objectives of this form is a computationally intractable problem. We develop approximation algorithms to optimize these objectives and establish guarantees for their approximation rations. Then, we incorporate multiple fairness constraints in the optimization problems and establish relative bounds on the solutions with versus without these constraints. Finally, we apply our methodology to a variety of data, both in the context of a system of large financial institutions with real-world data, as well as in a realistic societal context with financial interactions between people and businesses for which we use semi-artificial data derived from mobility patterns. Our results suggest that the algorithms we develop and study have reasonable results in practice and outperform other network-based heuristics. We argue that the presented problem through the societal-level lens could assist policymakers in making informed decisions on issuing subsidies.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/19/2019

Towards Federated Graph Learning for Collaborative Financial Crimes Detection

Financial crime is a large and growing problem, in some way touching alm...
research
11/26/2019

Measuring systemic risk and contagion in the European financial network

This paper introduces a novel framework to study default dependence and ...
research
03/02/2021

Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints

Metric clustering is fundamental in areas ranging from Combinatorial Opt...
research
06/08/2023

Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling

Graph clustering is a fundamental task in network analysis where the goa...
research
05/26/2022

Dynamic Interventions for Networked Contagions

We study the problem of designing dynamic intervention policies for mini...
research
05/16/2023

Graph Reinforcement Learning for Network Control via Bi-Level Optimization

Optimization problems over dynamic networks have been extensively studie...
research
01/17/2013

Financial Portfolio Optimization: Computationally guided agents to investigate, analyse and invest!?

Financial portfolio optimization is a widely studied problem in mathemat...

Please sign up or login with your details

Forgot password? Click here to reset