Axiomatic and Dynamic Processes for a Symmetric Allocation Rule

Abstract

It has recently become imperative to analyze relevant issues to improve the efficiency of resource allocation by means of different perspectives and ways of thinking. There exist numerous decisive factors, such as changes in forms of allocation, reactive behavior, and the interaction and functional effectiveness of strategies, that need to be complied. In contrast to expert meetings, rules of thumb, or other existing concepts, this article aims to offer a different and efficient resource allocation approach by applying game-theoretical methods to resource-allocation situations. Our major investigative procedures are as follows: (1) after comparing our method with pre-existing allocation rules from pre-existing allocation rules, a symmetric allocation rule is proposed that considers both units and their energy grades; (2) based on the properties of grade completeness, criterion for models, unmixed equality symmetry, grade synchronization, and consistency, some axiomatic outcomes are used to examine the mathematical accuracy and the applied rationality of this symmetric allocation rule; (3) based on a symmetrical revising function, a dynamic process is applied to show that this symmetric allocation rule can be reached by units that start from an arbitrary grade completeness situation; and (4) these axiomatic and dynamic results and related meanings are applied to show that this symmetric allocation rule can present an optimal alternative guide for resource-allocation processes. Related applications, comparisons, and statements are also offered throughout this article.