Heterogeneous decision-making dynamics of threshold-switching agents on complex networks.

ABSTRACT

In the classical two-player decision-making scenario, individuals may have different tendencies to take a certain action, given that there exists a sufficient number of neighbors adopting a particular option. This is ubiquitous in many real-life contexts including traffic congestion, crowd evacuation, and minimal vertex cover problem. Under best-response dynamics, we investigate the decision-making behaviors of heterogeneous agents on complex networks. Results of the networked games are twofold for networks of uniform degree distribution (e.g., the lattice) and fraction of the strategy is of a linear function of the threshold setting. Moreover, the equilibrium analysis is provided and the relationship between the equilibrium dynamics and the change of the threshold value is given quantitatively. Next, if the games are played on networks with non-uniform degree distribution (e.g., random regular and scale-free networks), influence of the threshold-switching will be weakened. Robust experiments indicate that it is not the value of the average degree, but the degree distribution that influences how the strategy evolves affected by the threshold settings. Our result shows that the decision-making behaviors can be effectively manipulated by tuning the parameters in the utility function (i.e., thresholds) of some agents for more regular network structures.