Wireless Communications and Mobile Computing

Allocation Mechanism Design and Application for Competitive Resources


Publishing date
01 Apr 2021
Status
Closed
Submission deadline
20 Nov 2020

Lead Editor
Guest Editors

1Yangzhou University, Yangzhou, China

2University of Vermont, Burlington, USA

3University of Wollongong, Wollongong, Australia

This issue is now closed for submissions.
More articles will be published in the near future.

Allocation Mechanism Design and Application for Competitive Resources

This issue is now closed for submissions.
More articles will be published in the near future.

Description

There is a lot of competition for resources in the environment of multi-agent systems, such as cloud platforms and services, network virtualization environment, and virtual human resource platforms, etc. As resources are scarce and limited, designing an excellent resource allocation mechanism to make full use of these competitive resources and maximize the benefits of the system or agents has become an urgent problem.

Computer theory, auction theory, and game theory provide a solid foundation for the design of these mechanisms. The scope of this research area ranges from modelling of the competitive resource allocation problem to the simulation of the competitive resource allocation platform, to the development of novel engineering solutions for complex resource allocation problems, and bridges several disciplines to provide new insights into economics, mathematics, engineering, computer science and theory.

The aims of this Special Issue are to present state-of-the-art research on competitive resource allocation problems, especially the allocation mechanism design for competitive resources, and to provide a forum for experts to disseminate their recent advances and views on future perspectives in this field. Original research and review articles are welcome.

Potential topics include but are not limited to the following:

  • Resource allocation mechanisms based on auction theory
  • Resource allocation mechanisms based on reinforcement learning
  • Partnership formation and utility sharing algorithms
  • Multi-agent cooperation game algorithms
  • Approximate optimal algorithms for resource allocation
  • Other novel resource allocation frameworks and mechanisms

Articles

  • Special Issue
  • - Volume 2021
  • - Article ID 6653883
  • - Research Article

A Random Label and Lightweight Hash-Based Security Authentication Mechanism for a UAV Swarm

Feng Hu | Hongyan Qian | Liangjun Liu
  • Special Issue
  • - Volume 2021
  • - Article ID 6639107
  • - Research Article

Blockchain-Based Trust Auction for Dynamic Virtual Machine Provisioning and Allocation in Clouds

Hao Xu | Weifeng Liu | Xu Liu
  • Special Issue
  • - Volume 2021
  • - Article ID 6693636
  • - Research Article

Coordinated Control of Distributed Traffic Signal Based on Multiagent Cooperative Game

Zhenghua Zhang | Jin Qian | ... | Quan Su
  • Special Issue
  • - Volume 2021
  • - Article ID 8836615
  • - Research Article

Path Planning of Mobile Robot Based on Improved Multiobjective Genetic Algorithm

Kairong Li | Qianqian Hu | Jinpeng Liu
  • Special Issue
  • - Volume 2021
  • - Article ID 8899852
  • - Research Article

Hierarchical Annotation Event Extraction Method in Multiple Scenarios

Shi Wang | Zhujun Wang | ... | Huayu Wang
  • Special Issue
  • - Volume 2021
  • - Article ID 5520990
  • - Review Article

A Survey of Nearest Neighbor Algorithms for Solving the Class Imbalanced Problem

Bo Sun | Haiyan Chen
  • Special Issue
  • - Volume 2020
  • - Article ID 8884678
  • - Research Article

Efficient Planning and Solving Algorithm of -Shape Acceleration and Deceleration

Zhijie Li | Ligang Cai | Zhifeng Liu
Wireless Communications and Mobile Computing
Publishing Collaboration
More info
Wiley Hindawi logo
 Journal metrics
Acceptance rate33%
Submission to final decision81 days
Acceptance to publication37 days
CiteScore4.300
Impact Factor2.336
 Submit

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.