Social-inverse: Inverse decision-making of social contagion management with task migrations

G Tong - Advances in Neural Information Processing …, 2022 - proceedings.neurips.cc
Considering two decision-making tasks $ A $ and $ B $, each of which wishes to compute
an effective decision $ Y $ for a given query $ X $, can we solve task $ B $ by using query …

[PDF][PDF] A Learning Approach to Complex Contagion Influence Maximization

H Chen, B Wilder, W Qiu, B An, E Rice… - Proceedings of the …, 2023 - personal.ntu.edu.sg
Influence maximization (IM) aims to find a set of seed nodes in a social network that
maximizes the influence spread. While most IM problems focus on classical influence …

Learnability of competitive threshold models

Y Wang, G Tong - arXiv preprint arXiv:2205.03750, 2022 - arxiv.org
Modeling the spread of social contagions is central to various applications in social
computing. In this paper, we study the learnability of the competitive threshold model from a …

Reinforcement Learning in A Marketing Game

MG Reyes - Intelligent Computing: Proceedings of the 2019 …, 2019 - Springer
This paper discusses a reinforcement learning interpretation of A Marketing Game, a model
of socially-contingent decision-making that includes marketing by companies, which …

Removal of data incest in multi-agent social learning in social networks

M Hamdi, V Krishnamurthy - arXiv preprint arXiv:1309.6687, 2013 - arxiv.org
Motivated by online reputation systems, we investigate social learning in a network where
agents interact on a time dependent graph to estimate an underlying state of nature. Agents …

A tutorial on interactive sensing in social networks

V Krishnamurthy, HV Poor - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
This paper considers models and algorithms for interactive sensing in social networks in
which individuals act as sensors and the information exchange between individuals is …

Stratlearner: Learning a strategy for misinformation prevention in social networks

G Tong - Advances in Neural Information Processing …, 2020 - proceedings.neurips.cc
Given a combinatorial optimization problem taking an input, can we learn a strategy to solve
it from the examples of input-solution pairs without knowing its objective function? In this …

Loss bounds for approximate influence-based abstraction

E Congeduti, A Mey, FA Oliehoek - arXiv preprint arXiv:2011.01788, 2020 - arxiv.org
Sequential decision making techniques hold great promise to improve the performance of
many real-world systems, but computational complexity hampers their principled application …

Real-time Network Intrusion Detection via Decision Transformers

J Chen, H Zhou, Y Mei, G Adam, ND Bastian… - arXiv preprint arXiv …, 2023 - arxiv.org
Many cybersecurity problems that require real-time decision-making based on temporal
observations can be abstracted as a sequence modeling problem, eg, network intrusion …

Cost function learning in memorized social networks with cognitive behavioral asymmetry

Y Mao, J Li, N Hovakimyan… - IEEE Transactions …, 2022 - ieeexplore.ieee.org
This article investigates the cost function learning in social information networks, wherein
human memory and cognitive bias are explicitly taken into account. We first propose a …