Abstract
The resource allocation problem is a fundamental problem in distributed systems. In this paper, we focus on constructing nondominated (ND) coteries to solve the problem. Distributed algorithms using coteries usually incur lower communication overhead and have higher degree of fault-tolerance, and ND coteries are candidates for achieving the lowest communication cost and the highest degree of fault-tolerance. We use an operation called pairwise-union (p-union), which can be applied to known coteries to generate coteries for solving the resource allocation problem. We develop a theorem to check whether a coterie used for resource allocation is dominated or not. By the theorem, we prove that the p-union operation can be applied to ND coteries to generate new ND coteries for resource allocation.