论文标题
基于组合拍卖的频道分配的大风 - 夏普利预设法的最佳参数化
Optimal Parametrization of the Gale-Shapley Preallocation Method for Combinatorial Auction-based Channel Assignment
论文作者
论文摘要
基于组合拍卖的算法在多连通性超可靠的无线网络中应用其应用通道分配问题显示出很大的潜力。但是，这种算法所需的计算工作随着用户和资源的数量而迅速增长。因此，基于预先定位的组合拍卖代表了这些设置的一种有希望的方法。预设的目的是限制参与者在组合拍卖过程中提交的投标数量，从而减少计算需求并实现拍卖问题的数值可行性。通过限制拍卖参与者（租户）在投标中考虑的项目数量（渠道）的数量来实现投标数量。因此，预先分配的目的是非固定地将渠道分配给租户。此任务是拍卖程序中后来出版的生成的基础。在本文中，我们分析了多到许多大风 - 夏普利预设方法的最佳参数化，并为最佳性能提出建议。数值评估表明，适当的预订对性能和计算需求有重大影响。
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.
