Optimal Intervention in Economic Networks using Influence Maximization Methods

02/02/2021
by   Ariah Klages-Mundt, et al.
0

We consider optimal intervention in the Elliott-Golub-Jackson network model and show that it can be transformed into an influence maximization problem, interpreted as the reverse of a default cascade. Our analysis of the optimal intervention problem extends well-established targeting results to the economic network setting, which requires additional theoretical steps. We prove several results about optimal intervention: it is NP-hard and additionally hard to approximate to a constant factor in polynomial time. In turn, we show that randomizing failure thresholds leads to a version of the problem which is monotone submodular, for which existing powerful approximations in polynomial time can be applied. In addition to optimal intervention, we also show practical consequences of our analysis to other economic network problems: (1) it is computationally hard to calculate expected values in the economic network, and (2) influence maximization algorithms can enable efficient importance sampling and stress testing of large failure scenarios. We illustrate our results on a network of firms connected through input-output linkages inferred from the World Input Output Database.

READ FULL TEXT
research
03/09/2018

On Optimal Polyline Simplification using the Hausdorff and Fréchet Distance

We revisit the classical polygonal line simplification problem and study...
research
03/23/2020

Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization

We study the r-complex contagion influence maximization problem. In the ...
research
11/30/2022

Nonmonontone submodular maximization under routing constraints

In machine learning and big data, the optimization objectives based on s...
research
09/26/2022

On the Parameterized Intractability of Determinant Maximization

In the Determinant Maximization problem, given an n× n positive semi-def...
research
09/27/2019

Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization

Circuit-augmentation algorithms are a generalization of the Simplex meth...

Please sign up or login with your details

Forgot password? Click here to reset