Bing Ai

Bing Ai


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 April 2020 in IEEE Intelligent Systems
Verified
Journal Article
Closed access
BABing Ai
Bing Ai
WWWanyuan Wang
Wanyuan Wang
MHMinghui Hua
Minghui Hua
YJYichuan Jiang
Yichuan Jiang
JJJ. Jiang
J. Jiang
YZYifeng Zhou
Yifeng Zhou
Crowdsourcing e-markets have been widely used to complete various complex tasks with the help of seamlessly integrating the ubiquitous intelligent systems and artificial intelligence. Most of traditional crowdsourcing e-markets focus primarily on individual incentives to motivate workers to participate. However, workers generally have heterogeneous values, which brings forth an undesirable outcome that workers with larger values monopolize a fixed total payment. This monopolization discourages the workers with smaller values from participating, thereby severely reducing the quality of individual-oriented crowdsourcing e-markets. Thus, this article proposes a team formation (TF) games-based mechanism in which workers are incentivized to form teams and obtain payments according to their contributions. Moreover, the existence of Nash equilibrium for a given TF game is rigorously analyzed. Finally, the experimental results in terms of both simulated and realistic datasets demonstrate that, as compared with state-of-the-art methods, our mechanism can achieve higher crowdsourcing e-markets quality.

10 December 2025 in IEEE Transactions on Sustainable Computing
Verified
Journal Article
Closed access
BABing Ai
Bing Ai
GYGuodong Ye
Guodong Ye
ZWZijun Wu
Zijun Wu
YSYu Sun
Yu Sun
Coalition Formation (CF) game emerges as a pioneering framework for the resource allocation in Unmanned Aerial Vehicles (UAVs) equipped with various types and complementary resources. However, both the overlapping-enabled collaborative CF and inter-coalition competitive behaviors significantly affect the system performance in complex multi-UAV scenarios. In this paper, we propose a Multiple Overlapping Coalitions (MOC) noncooperative game. Specifically, we first establish an optimization model encompassing coupled resource constraints. Subsequently, a task-priority-based incentive mechanism is designed to better motivate participation. To achieve the Nash equilibrium, a two-step solution technique incorporating relaxation and fine-tuning of resource granularity is designed. We propose a MOC noncooperative game-combined Multi-agent Proximal Policy Optimization (MAOPPPO). The simulation results substantiate that our approach outperforms the other five state-of-the-art learning countermeasures in terms of average reward with a gain of up to $4.59\%$ after 800 of training episodes. In terms of throughput, the proposed MOC noncooperative game increases by $66.67\%$, $93.68\%$, and $11.76\%$ compared with that of CF noncooperative game, non-CF noncooperative game, and consensus-based algorithm, respectively. For total resource contribution, the improvements are $62.99\%$, $94.59\%$, and $23.16\%$, respectively. The energy efficiency enhances by $6.82\%$, $23.68\%$, and $4.78\%$ compared to the other three baselines, respectively.

16 March 2026 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
JZJinquan Zhang
Jinquan Zhang
HCHan Cao
Han Cao
LCLong Chen
Long Chen
SLSiyuan Li
Siyuan Li
XLXiaoping Li
Xiaoping Li
BABing Ai
Bing Ai
In this paper, we investigate the problem of minimizing the total energy consumption for serverless functions (SFs) while ensuring that the cold start probability of each SF remains below a specified threshold. In serverless computing, containers are reused to reduce the occurrence of cold starts, which increases the static energy consumption and decreases the dynamic energy consumption of physical machines (PMs). The trade-off between cold start reduction and energy consumption introduces significant challenges, especially considering that container states (idle, cold start, and running) have distinct energy characteristics. To address these challenges, we propose a container-state-aware energy consumption model that accurately captures the dynamic energy characteristics of PMs. Furthermore, we develop an enhanced Bayesian Optimization-Based Energy Consumption Minimization (BOECM) algorithm, which determines the optimal reuse times for different serverless functions (SFs) by decomposing the high-dimensional search space into a series of lower-dimensional sub-problems. In addition, several tailored heuristic strategies are proposed for request allocation and container deployment. The proposed BOECM algorithm is compared with several existing heuristic and meta-heuristic algorithms for similar problems. Experimental results demonstrate that the proposed method significantly reduces total energy consumption, maintains cold start probabilities within acceptable limits, and outperforms the baselines.

21 June 2025 in International Journal of Wavelets, Multiresolution and Information Processing
Verified
Journal Article
Closed access
WXWei Xu
Wei Xu
BZBiao Zhou
Biao Zhou
LXLixiang Xu
Lixiang Xu
QCQingzhe Cui
Qingzhe Cui
BABing Ai
Bing Ai
YTYuan Yan Tang
Yuan Yan Tang

22 July 2026 in Cognitive Computation
Verified
Journal Article
Open access
PDF file
BABing Ai
Bing Ai
YSYu Sun
Yu Sun
JWJun Wang
Jun Wang
MJMengyuan Jiang
Mengyuan Jiang
MZMeiling Zhang
Meiling Zhang
SZSiyu Zhu
Siyu Zhu
With the popularization of Internet of Things devices, the volume of data generated at the network edge has grown explosively. As a distributed machine learning solution, Federated Edge Learning (FEL) in mobile edge computing (MEC) provides an effective way to protect privacy by training locally and sharing only model parameters rather than the original data. However, in practical applications, FEL faces two core challenges: First, the data heterogeneity of each edge device can lead to deviations in the global model; The second is how to design an effective incentive mechanism to encourage nodes with limited resources to continuously participate in training. Our aims to simultaneously address these two major challenges by optimizing the local training and global aggregation processes to comprehensively enhance the efficiency and performance of FEL. For this reason, we propose a hybrid model. Firstly, the Stackelberg Stackelberg game model is adopted to describe the relationship between aggregators and edge devices. Meanwhile, the existence of Nash equilibrium is theoretically proved to ensure the stability of the model. Secondly, we propose a novel algorithm named Group Relative Policy Optimization Based on Hierarchical Mean-Field Theory (OGRPO-HMF), which can jointly optimize the local training of nodes and the global model aggregation of servers. We validate the effectiveness and generality of our approach through extensive experimentation on various FEL tasks, showcasing significant performance gains. Extensive experiments on benchmark FEL datasets demonstrate the superior performance of our proposed algorithm, improving the global test accuracy by up to \(2.26\%\) and reducing the global test loss by up to \(66.27\%\) compared to the state-of-the-art counterparts.