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

Qian Jun

dblp:49/6529 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

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

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

Computer networks
1 paper
Network optimization and economics · 67% Software-defined and programmable networks · 33%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics
auction mechanism
0.612022
Revenue-Optimal Auction For Resource Allocation in Wireless Virtualization: A Deep Learning Approach · IEEE Trans. Mob. Comput. 2022
Network optimization and economics
resource allocation
0.612022
Revenue-Optimal Auction For Resource Allocation in Wireless Virtualization: A Deep Learning Approach · IEEE Trans. Mob. Comput. 2022
Software-defined and programmable networks › network virtualization
wireless network virtualization
0.612022
Revenue-Optimal Auction For Resource Allocation in Wireless Virtualization: A Deep Learning Approach · IEEE Trans. Mob. Comput. 2022
Algorithmic game theory and mechanism design › mechanism design › auction design
revenue-maximizing auction
0.612022
Revenue-Optimal Auction For Resource Allocation in Wireless Virtualization: A Deep Learning Approach · IEEE Trans. Mob. Comput. 2022

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

deep learning · 1.1feedforward neural network · 0.6feed-forward neural network · 0.6
YearPublicationVenuePosition
2022 Revenue-Optimal Auction For Resource Allocation in Wireless Virtualization: A Deep Learning Approach
abstract
Wireless virtualization has become a key concept in future cellular networks which can provide multiple virtualized wireless networks for different mobile virtual network operators (MVNOs) over the same physical infrastructure. Resource allocation is a main challenging issue in wireless virtualization for which auction approaches have been widely used. However, for most existing auction-based allocation schemes, the objective is to maximize the social welfare (i.e., the sum of all valuations of winning bidders) due to its simplicity. While in reality, MVNOs are more interested in maximizing their own revenues (i.e., received payments from auction winners). However, the revenue-optimal auction problem is much more complex since the payment price is unknown before calculation. In this paper, we aim to design a revenue-optimal auction mechanism for resource allocation in wireless virtualization. Considering the complexity, deep learning techniques are applied. Specifically, we construct a multi-layer feed-forward neural network based on the analysis of optimal auction design. The neural network adopts users’ bids as the input and the allocation rule and conditional payment rule for the users as the output. The proposed auction mechanism possesses several desirable properties, e.g., individual rationality, incentive compatibility and budget constraint. Finally, simulation results demonstrate the effectiveness of the proposed scheme. Comparing with second-price auction and optimization-based schemes, the proposed scheme can increase the revenue by 10 and 30 percent on average, for single MVNO and multi-MVNO cases, respectively.
Kun Zhu 0001, Yuanyuan Xu 0001, Qian Jun, Dusit Niyato
IEEE Trans. Mob. Comput.3