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

Ziya Chen

dblp:302/9534 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
0000-0002-2290-8365ORCID · corroborated

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

Computer networks · 2 · 1 first-author · 2 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.

Computer networks
2 papers
Network optimization and economics · 78% Edge and fog computing · 22%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › network economics
pricing and service selection
1.012026
Efficient Service Selection and Pricing in Edge-Cloud Computing Markets · IEEE Trans. Netw. 2026
Network optimization and economics › resource allocation › market-based resource allocation
pricing mechanism
1.012026
Efficient Service Selection and Pricing in Edge-Cloud Computing Markets · IEEE Trans. Netw. 2026
Network optimization and economics
social welfare maximization
1.012026
Efficient Service Selection and Pricing in Edge-Cloud Computing Markets · IEEE Trans. Netw. 2026
Edge and fog computing › mobile edge computing
computation offloading
0.812024
Price Competition in Multi-Server Edge Computing Networks Under SAA and SIQ Models · IEEE Trans. Mob. Comput. 2024
Network optimization and economics › pricing › game-theoretic pricing
price competition
0.812024
Price Competition in Multi-Server Edge Computing Networks Under SAA and SIQ Models · IEEE Trans. Mob. Comput. 2024
Algorithmic game theory and mechanism design › solution concepts in games › equilibrium concepts
nash equilibrium
0.212024
Price Competition in Multi-Server Edge Computing Networks Under SAA and SIQ Models · IEEE Trans. Mob. Comput. 2024

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

queueing theory · 1.5game theory · 1.5stackelberg game · 1.0evolutionary game theory · 1.0dynamic pricing · 1.0
YearPublicationVenuePosition
2026 Efficient Service Selection and Pricing in Edge-Cloud Computing Markets
abstract
Cloud and edge computing service providers (SPs) provide heterogeneous computing services to users, which forms the computing market. However, users’ service selections among SPs are unbalanced, resulting in inefficient resource utilization. In this paper, we analyze users’ service selection behaviors and design efficient pricing mechanisms to optimize the social welfare of the computing market. Considering the huge number of users and heterogeneous service providers, users can hardly acquire complete information to make their decisions, and we model users’ interactions as a dynamic service selection evolutionary game. Analyzing the evolutionary stable state (ESS) of the game and designing efficient pricing mechanisms for edge-cloud computing markets are challenging due to the implicit relationship between prices and users’ service selection dynamics, and the heterogeneity of service providers and user populations. We first investigate a single-population scenario where users are homogeneous, for which we prove that the ESS is unique. We design a static pricing mechanism which depends on SPs’ marginal costs and computation capacities, and a dynamic pricing mechanism which also depends on SPs’ real-time congestion tax. We prove that under our pricing mechanisms, the ESS is the socially optimal state and is globally asymptotic stable. We then analyze the general multi-population scenario where users are heterogeneous, for which we prove that the ESS exists but may be not unique. We design a static pricing mechanism (and a dynamic pricing mechanism) which depends on SPs’ marginal costs and the social-optimal average delay costs (and the real-time average delay costs). We prove that under our pricing mechanisms, the socially optimal state is an ESS and is asymptotically stable. Simulation results validate the effectiveness of our designed pricing mechanisms.
Qian Ma 0002, Ziya Chen, Lin Gao 0001, Xu Chen 0004
IEEE Trans. Netw.2
2024 Price Competition in Multi-Server Edge Computing Networks Under SAA and SIQ Models
abstract
With the proliferation of edge computing, many business entities deploy their own edge servers to compete for users, which forms multi-server edge computing networks. However, no prior work studies the competition among heterogeneous edge servers and how the competition affects users’ selfish computation offloading behaviors in such a network from an economic perspective. In this paper, we model the interactions between edge servers and users as a two-stage game. In Stage I, edge servers with heterogeneous marginal costs set their service prices to compete for users, and in Stage II, each user selfishly offloads its task to one of the edge servers or the remote cloud. Analyzing the equilibrium of the two-stage game is challenging due to edge servers’ heterogeneity and the congestion effect caused by resource sharing among users. We first investigate the equilibrium when edge servers follow the serve-as-arrive (SAA) model (i.e., serving all offloaded tasks simultaneously), and then extend our analysis to the serve-in-queue (SIQ) model (i.e., serving offloaded tasks one by one following the M/M/1 queue rule). Under the SAA model, we prove that users’ selfish computation offloading game in Stage II is a potential game and admits a unique Nash equilibrium (NE), for which we derive the explicit expressions. Furthermore, for edge servers’ price competition game in Stage I, we characterize the conditions for the uniqueness of the NE and derive its explicit expression. Under the SIQ model, we derive the unique NE of users’ selfish computation offloading game, and show that the NE of edge servers’ price competition game may not always exist. We compare the equilibrium under the two service models and show that at equilibrium, edge servers with low marginal costs can achieve higher profits under the SIQ model when edge servers’ computation capacity is large or the delay incurred on the cloud is moderate; however, edge servers with high marginal costs can obtain higher profits under the SAA model in most cases.
Ziya Chen, Qian Ma 0002, Lin Gao 0001, Xu Chen 0004
IEEE Trans. Mob. Comput.1
2021 Edgeconomics: Price Competition and Selfish Computation Offloading in Multi-Server Edge Computing Networks
abstract
As edge computing provides crucial support for delay-sensitive and computation-intensive applications, many business entities deploy their own edge servers to compete for users, which forms multi-server edge computing networks. However, no prior work studies the competition among heterogeneous edge servers and how the competition affects users’ selfish computation offloading behaviors in such a network from an economic perspective. In this paper, we model the interactions between edge servers and users as a two-stage game. In Stage I, edge servers with heterogeneous marginal costs set their service prices to compete for users, and in Stage II, each user selfishly offloads its task to one of the edge servers or the remote cloud. Analyzing the equilibrium of the two-stage game is challenging due to edge servers’ heterogeneity and the congestion effect caused by resource sharing among users. We first prove that in Stage II, users’ selfish computation offloading game is a potential game and admits a unique Nash equilibrium (NE), for which we derive the explicit expression. We then analyze edge servers’ price competition game in Stage I and characterize the conditions for the uniqueness of the NE. We show that at equilibrium, users only choose low-priced edge servers, and hence edge servers with low marginal costs can win the price competition, which reflects the improvement of economic efficiency in competitive markets. Moreover, it is surprising that the equilibrium prices do not monotonically increase with the task execution delay. This is because a long execution delay gives a chance to edge servers with high marginal costs to win the competition, which results in more fierce competition among edge servers.
Ziya Chen, Qian Ma 0002, Lin Gao 0001, Xu Chen 0004
WiOpt1