Juan Wang’s research while affiliated with Tianjin University of Technology and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (63)


In a regular lattice network, under the different amount of punishment β, with the increase in the penalty cost of α, investment group’s final proportion ( ρ I + P I), the initial ratio, respectively, four strategies: ρ I = 0.2, ρ P I = 0.1, ρ T = 0.3, ρ U = 0.4, and R T = 6. The value of α is changed from 1.0 to 2.0 with a step size of 0.05. The reputation maximum threshold R i in (a) is 100 and that in (b) is 200. The other parameters are the same.
Diagram of the evolution of policy distribution over time under different values of β. In panel (a) α = 0.5 and β = 0.8, in panel (b) α = 0.8 and β = 0.8, and in panel (c) α = 1.0 and β = 0.8. The initial proportions of the four strategies were as follows: ρ I = 0.2, ρ P I = 0.1, ρ T = 0.3, ρ U = 0.4, and dilemma intensity r U T = 0.6, where the purple, red, blue, and green solid lines represent K I, K P I, K T, and K U, respectively, at each Monte Carlo simulation (MCS) step, the evolution of the four parameters was meticulously documented, and each experiment was conducted 30 times.
Panel (a) shows in detail the evolution of different strategies over time under the traditional punishment mechanism. All other relevant parameters are consistent with the setting in Fig. 2(a), which ensures the consistency and comparability of experimental conditions. Panel (b), however, reveals the significant difference between the traditional punishment method and the innovative graded punishment method in influencing the evolution of the density of investment groups, that is, ρ I + P I, through intuitive comparison.
A snapshot showing how the four strategies are distributed over time on a square-shaped network. The time steps are set at MCS = 1, 10, 100, 1000, and 5000, respectively. Dilemma strength r U T = 0.6, R T = 6, α = 0.5, and β = 0.8. In the figure, the first row presents the snapshots for the modified hierarchical penalty model, and the second row denotes the results of the traditional penalty model. The figure’s bottom right corner includes annotations indicating the strategies represented by the different colors. The purple represents the investor, the red represents the punishment-type investors, the blue represents the trustworthy trustee, and the green represents the untrustworthy trustee.
Under different penalty amount β, with the increase in trust temptation betrayal intensity r U T, the proportion of investment groups. The network structure is a regular lattice network. For each β, the value of r U T varies from 0 to 1.0 in steps of 0.02, α = 0.5, The other parameters are set to default values.

+1

Dynamic evolution in multi-player networked trust games with graded punishment
  • Article
  • Publisher preview available

March 2025

·

29 Reads

Juan Wang

·

Zhuo Liu

·

Yan Xu

·

Trust holds a pivotal position in contemporary society. Yet, the question of how to elevate and sustain trust among selfish individuals poses a formidable challenge. To delve into this issue, we incorporate a graded punishment strategy into a networked N-player trust game, aiming to observe the progression of trust-related behavior. Within this game framework, punishers uphold a certain degree of trust among the participants by incurring an extra expense to exclude those who betray trust. By conducting numerous Monte Carlo simulation experiments, we uncover that the graded punishment strategy can effectively curtail untrustworthy conduct to a significant degree, potentially even eliminating such behavior, thereby fostering an improvement in the overall trust level within the population. However, to effectively deploy this strategy, it is imperative to strike a balance between the penalty cost and the penalty amount, ensuring that the natural evolution of the system is not unduly disrupted. This balance is crucial for preserving the stability and sustainability of the system while safeguarding trust. Broadly speaking, our study offers fresh insights and approaches for enhancing and maintaining trust in the networked society, while also highlighting the avenues and challenges for future research, particularly in the realm of applying graded punishment strategies.

View access options





An improved classification diagnosis approach for cervical images based on deep neural networks

July 2024

·

23 Reads

·

2 Citations

Pattern Analysis and Applications

In order to enhance the speed and performance of cervical diagnosis, we propose an improved Residual Network (ResNet) by combining pyramid convolution with depth-wise separable convolution to obtain the high-quality cervical classification. Since most of cervical images from patients are not in the center of colposcopy images, we devise the segmentation and extraction algorithm of the center movement of the region of interest (ROI), which will further enhance the classification performance. Extensive experiments indicate that our model can not only achieve the lightweight network model, but also fulfil the classification prediction, such as for three-classification of cervical lesions, the classification accuracy is as high as 91.29%%\%, the precision is 89.70%%\%, the sensitivity is 88.75%%\%, the specificity is 94.98%%\%, the rate of missed diagnosis is 11.25%%\% and the rate of misdiagnosis is 5.02%%\%. Finally, after dividing the colposcopy images into four categories, it is shown that our results are still better than those obtained from many previous works as far as the cervical image classification is concerned. The current work can not only assist doctors to quickly diagnose cervical diseases, but also the classification performance can meet some clinical requirements in practice.



Higher-order temporal interactions promote the cooperation in the multiplayer snowdrift game

November 2023

·

26 Reads

·

31 Citations

Science China Information Sciences

To explore evolutionary dynamics of collective behaviors within the interconnected population, previous studies usually map non-pairwise interactions to higher-order static networks. However, from human communications to chemical reactions and biological systems, interactions often change over time, which cannot be simply described by higher-order static networks. In this study, we introduce time effects into higher-order networks and correspondingly investigate the evolutionary dynamics of multiplayer snowdrift games on higher-order temporal networks. Specifically, extensive simulations from four empirical datasets reveal that (1) the temporal effect of higher-order networks can facilitate the evolution of cooperation; (2) the higher-order topology can enhance the emergence of cooperation within a certain range of parameters; (3) the contribution of temporal burstiness and participants burstiness to cooperation is reversed. Furthermore, we theoretically demonstrate that the higher-order structure will suppress the propagation of defection in temporal networks. Our findings offer a new avenue for studying the evolution of altruistic behaviors in realistic complex networks.


Utility coupling promotes cooperation in multiplayer snowdrift games on interdependent simplicial networks

November 2023

·

32 Reads

·

4 Citations

The European Physical Journal Special Topics

Real-world social networks often contain not only one-to-one pairwise interactions, but also multi-person group interactions involving more than two individuals. To reveal the important role of such group interactions (i.e., higher order topology) for the evolution of cooperation, we here use interdependent simplicial network topologies, where the evolutionary interactions, governed by the snowdrift game, are thus explored beyond pairwise links. We also consider utility coupling between two network layers in an uncorrelated interdependence. Systematic Monte Carlo simulations lead us to two main conclusions. First, we find that the level of cooperation can be elevated by increasing the utility coupling value. And second, cooperation tends to decline when we increase the number of 2-simplex interactions. However, despite the later result, the overall cooperation level on both interdependent networks is still higher than that on any isolated network. We hope that these results will inspire future research on cooperation among unrelated individuals in higher order networks.



Citations (50)


... Consequently, researchers have widely incorporated Q-learning into the analysis of game dynamics to enhance cooperation in social dilemmas. [49][50][51][52][53][54][55][56][57] In summary, reinforcement learning methodologies effectively promote cooperation in game-theoretic models by necessitating that participants balance personal and collective interests through choices between cooperation and defection. However, in complex real-world contexts, individuals may prefer self-reliance over unproductive collective actions, thereby becoming "Lone Wolves" and introducing a third strategy: going it alone. ...

Reference:

Promoting cooperation in the voluntary prisoner's dilemma game via reinforcement learning
Reinforcement learning and collective cooperation on higher-order networks
  • Citing Article
  • October 2024

Knowledge-Based Systems

... As a further step, Li et al. 31 focused on the potential impact of second-order reputation evaluation on trust dilemmas and found that this high-order reputation evaluation helps promote prosocial behaviors to avoid the initial dilemmas, which provided a new perspective for understanding the dynamics of trust mechanisms under different social structures and contexts. Recently, Liu et al. 32 incorporated an exclusion strategy into the trust game and demonstrated that this strategy could effectively mitigate untrustworthy behavior to a certain degree, potentially even eliminating such behavior among trustees. Consequently, this approach has made a favorable impact on enhancing the overall trust level within the group. ...

Evolutionary dynamics of networked N-player trust games with exclusion strategy
  • Citing Article
  • July 2024

Chaos Solitons & Fractals

... The development of efficient and accurate machine vision methods is crucial for enabling these robots to perform swift and precise gangue removal during raw coal transportation, thereby facilitating the transition toward environmentally sustainable coal production practices. Recent developments in convolutional neural networks have demonstrated remarkable potential in object detection tasks [8][9][10], particularly in coal-gangue discrimination applications [11]. Bounding boxes are used by object detection algorithms based on convolutional neural networks to identify the category and location of objects in images [12][13][14]. ...

An improved classification diagnosis approach for cervical images based on deep neural networks

Pattern Analysis and Applications

... Additionally, our study mainly focuses on promoting pro-social behaviours such as trust and trustworthiness, but it would be interesting to consider the goal of optimizing social welfare in the future [58]. Furthermore, our framework assumes random interactions among group members, but in reality, individual interactions are often constrained by social networks rather than being completely random [14,[59][60][61][62]. The dynamics within the structured population deserve further investigation to offer the deeper insight into the complexity of trust evolution [63]. ...

Higher-order temporal interactions promote the cooperation in the multiplayer snowdrift game
  • Citing Article
  • November 2023

Science China Information Sciences

... 42 Wang et al. studied link strategy in multilayer networks and demonstrated that individuals adopting diverse behaviors could better adapt to the environment and exert a positive impact on the entire network. 43 The link strategy allows for diversified responses to different neighbors. However, without the adaptive learning capability of RL, the model still lacks flexibility and real-time strategy optimization. ...

Enhancement of cooperation induced by information-payoff evolution on two-layed complex networks
  • Citing Article
  • December 2023

Physics Letters A

... The rapid development of complex networks, especially multi-layer networks, provides an ideal theoretical framework for characterizing the topological characteristics of these multiple complex interactions. [32][33][34][35] The powerful capabilities of multi-layer networks make them widely applicable. 36,37 For instance, multi-layer complex networks have been extended to describe many practical networks, such as aviation networks, power transmission networks, communication networks, and social networks. ...

Utility coupling promotes cooperation in multiplayer snowdrift games on interdependent simplicial networks
  • Citing Article
  • November 2023

The European Physical Journal Special Topics

... In network with simplexes, we cannot neglect the case that agent i belongs to different simplexes at the same time, which means that node i may participate in the game initiated by different neighbors. On this issue, Guo et al [46] discussed the effect of the weights of payoffs that node i receives from 1-simplex and 2-simplex on the outcome, so weights of the payoffs that node i receives from 1-simplex and 2-simplex in our model are equal. Specifically, the payoff of node i can be calculated through following steps. ...

Role of second-order reputation evaluation in the multi-player snowdrift game on scale-free simplicial complexes
  • Citing Article
  • July 2023

Chaos Solitons & Fractals

... PGGs are essential for understanding the mechanisms that sustain cooperation in human societies and biological populations. Several mechanisms supporting cooperation have been recognized such as direct and indirect reciprocity (cooperation can evolve when individuals interact repeatedly [HST + 18, XWPW23] or when reputation plays a role [NS98,XWPW23]), network and group structures (the spatial arrangement of individuals can promote cooperation by enabling clusters of cooperators to form and persist [SP05,SF07]) and institutional incentives (the introduction of costly punishment for defectors or rewards for contributors can sustain cooperation) [SHN01,HDP24,CSBD15,DH21b]. The latter mechanism is the focus of the present paper. ...

Reputation and Reciprocity
  • Citing Article
  • May 2023

Physics of Life Reviews

... [13][14][15][16][17] As a result, modeling and analyzing trust has become a long-standing concern of scholars from different fields and efforts to solve one of the key scientific questions. [18][19][20][21][22][23][24][25] In 1995, Berg et al. 26 proposed the theoretical modeling of trust game for the first time and quantitatively measured the trust behavior between two individuals. Subsequently, Abbass et al. 27 used the replication dynamics to analyze the evolution of trust game theoretically and proposed the evolutionary dynamics model of N-player trust game, which profoundly revealed that trust will Chaos ARTICLE pubs.aip.org/aip/cha ...

Reputation evaluation and its impact on the human cooperation—A recent survey