Optimal Parametrization of the Gale-Shapley Preallocation Method for Combinatorial Auction-based Channel Assignment

TL;DR

This paper investigates how to optimally parameterize the Gale-Shapley preallocation method to improve the efficiency and effectiveness of combinatorial auction-based channel assignment in wireless networks.

Contribution

It provides a detailed analysis and recommendations for the optimal settings of the Gale-Shapley preallocation method to enhance auction performance and reduce computational complexity.

Findings

Optimal preallocation parameters significantly improve auction efficiency.

Proper preallocation reduces computational demands in multi-user wireless networks.

Numerical results demonstrate improved performance with recommended settings.

Abstract

Algorithms based on combinatorial auctions show significant potential regarding their application for channel assignment problems in multi-connectivity ultra-reliable wireless networks. However the computational effort required by such algorithms grows fast with the number of users and resources. Therefore, preallocation-based combinatorial auction represents a promising approach for these setups. The aim of the preallocation is to constrain the number of bids submitted by participants in the combinatorial auction process, thus reducing computational demands and enabling numerical feasibility of the auction problem. Reduction of bid number is achieved via limiting the number of items (channels) considered by auction participants (tenants) in their bids. Thus the aim of preallocation is to non-exclusively assign channels to tenants. This assignment serves as a basis for the later bid generation in the auction procedure. In this paper we analyze the optimal parametrization of the many-to-many Gale-Shapley preallocation method and formulate recommendations for optimal performance. Numerical assessments illustrate that the appropriate preallocation has significant impact on the performance and computational demand.