Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hang Zhao 0003

dblp:31/2950-3 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0009-7550-4629ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational social science and digital humanities › social computing
crowdsourcing
0.912025
Exploitation and Confrontation: Sustainability Analysis of Crowdsourcing · IEEE Trans. Mob. Comput. 2025
Algorithmic game theory and mechanism design › mechanism design
crowdsourcing
0.912025
Exploitation and Confrontation: Sustainability Analysis of Crowdsourcing · IEEE Trans. Mob. Comput. 2025
Algorithmic game theory and mechanism design › repeated games
zero-determinant strategies
0.912025
Exploitation and Confrontation: Sustainability Analysis of Crowdsourcing · IEEE Trans. Mob. Comput. 2025
Algorithmic game theory and mechanism design › non-cooperative game › strategic game
continuous games
0.312025
Exploitation and Confrontation: Sustainability Analysis of Crowdsourcing · IEEE Trans. Mob. Comput. 2025

Methods — techniques the papers use, named apart from their topics

zero-determinant strategy · 1.7numerical simulation · 1.7game theory · 1.7
YearPublicationVenuePosition
2025 Exploitation and Confrontation: Sustainability Analysis of Crowdsourcing
abstract
Game theory is an effective analytical tool for crowdsourcing. Existing studies based on it share a commonality: the influence of players’ decisions isbilateral. However, the status is broken by the zero-determinant (ZD) strategy, where the ZD player canunilaterallycontrol the opponent's expected payoff. Thereby, crowdsourcing games trigger conclusions that differ from traditional ones. By addressing three questions, this paper is the first work to analyze the turbulence in crowdsourcing caused by the inequality between the requestor and the worker in the ZD game. The first question reveals the potential for the requestor to exploit the worker; the second question quantifies the worker's tolerance towards exploitation, providing a basis for confrontation; the third question serves as the cornerstone for maintaining the crowdsourcing, regulating the requestor's exploitative behavior. To answer these questions, we extend ZD strategies from binary games to continuous ones, not only revealing the requestor's dominance but also enriching the theoretical system of ZD strategies and broadening their application. Furthermore, we introduce the worker's dissatisfaction degree, identifying the exponential trend and decay rate, revealing optimal timing and speed for the worker's effective confrontation and maximum exploitation for the requestor. Numerical simulations have validated the effectiveness of our analyses.
Hang Zhao 0003, Shengling Wang 0001, Jian-Hui Huang, Yu Guo 0003, Xiuzhen Cheng
IEEE Trans. Mob. Comput.1
2024 Bioinvasion risk analysis based on automatic identification system and marine ecoregion data
abstract
The global maritime trade plays a key role in propagating alien aquatic invasive species, which incurs side effects in terms of environment, human health and economy. The existing biosecurity methods did not take into account the invaded risk as well as the diffusion of invasive species at the same time, which may lead to inadequate bioinvasion control. In addition, the lack of considering the impact of bioinvasion control on shipping also makes their methods cost-ineffective. To solve the problems of the existing methods, we employ the AIS data, the ballast water data and the water temperature & salinity data to construct two networks: the species invasion network (SIN) and the global shipping network (GSN). The former is used to analyze the potential of a port in propagating marine invasive species while the latter is employed to evaluate the shipping importance of ports. Based on the analysis of SIN and GSN, two categories of biosecurity triggering mechanisms are proposed. The first category takes into consideration both being bioinvaded and spreading invasive species and the second one concerns the shipping value of each port besides its invasion risk. A lot of case studies have been done to discover the key ports needed to be controlled preferentially under the guide of the proposed biosecurity triggering mechanisms. Finally, our correlation analysis shows that closeness is most highly correlated to the invasion risk.
Hang Zhao 0003, Shengling Wang 0001
High Confid. Comput.3
2024 Fog-computing based mobility and resource management for resilient mobile networks
abstract
Mobile networks are facing unprecedented challenges due to the traits of large scale, heterogeneity, and high mobility. Fortunately, the emergence of fog computing offers surprisingly perfect solutions considering the features of consumer proximity, wide-spread geographical distribution, and elastic resource sharing. In this paper, we propose a novel mobile networking framework based on fog computing which outperforms others in resilience. Our scheme is constituted of two parts: the personalized customization mobility management (MM) and the market-driven resource management (RM). The former provides a dynamically customized MM framework for any specific mobile node to optimize the handoff performance according to its traffic and mobility traits; the latter makes room for economic tussles to find out the competitive service providers offering a high level of service quality at sound prices. Synergistically, our proposed MM and RM schemes can holistically support a full-fledged resilient mobile network, which has been practically corroborated by numerical experiments.
Hang Zhao 0003, Shengling Wang 0001
High Confid. Comput.1