Efficient Algorithms for Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems

The core message of this article is to study the computational complexity and develop efficient algorithms for finding nontrivial minimum fixed points in discrete dynamical systems, which is an important problem in modeling the spread of undesirable contagions and decision-making in networked games.