基于组合拍卖的信道分配中Gale-Shapley预分配方法的最优参数化
Optimal Parametrization of the Gale-Shapley Preallocation Method for Combinatorial Auction-based Channel Assignment
AI总结：
针对组合拍卖信道分配算法计算量随用户和资源数快速增长的问题，研究多对多Gale-Shapley预分配方法的最优参数化，通过限制投标信道数降低计算量，数值评估表明其对性能和计算需求影响显著。
摘要：
基于组合拍卖的算法在多连接超可靠无线网络的信道分配问题中展现出巨大应用潜力。然而，这类算法所需的计算量会随用户和资源数量的增加而快速增长。因此，基于预分配的组合拍卖是适用于这类场景的一种很有前景的方法。预分配的目的是限制组合拍卖过程中参与者提交的投标数量，从而降低计算需求，使拍卖问题具备数值可行性。投标数量的减少是通过限制拍卖参与者（租户）在其投标中考虑的物品（信道）数量来实现的。因此，预分配的目标是将信道非排他性地分配给租户，这种分配是后续拍卖流程中生成投标的基础。本文分析了多对多Gale-Shapley预分配方法的最优参数化，并提出了实现最优性能的建议。数值评估表明，恰当的预分配对性能和计算需求有显著影响。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
