Optimal Parametrization and Comparative Analysis of Preallocation Methods for Combinatorial Auction-Based Channel Assignment

09/01/2022
by   Dávid Csercsik, et al.
0

Algorithms based on combinatorial auction (CA) show significant potential regarding their application for channel assignment problems in multiconnective ultra-reliable wireless networks. However the computational effort required by such algorithms grows fast with the number of users and resources. Therefore, preallocation-based CA represents a promising approach for these setups. The aim of preallocation is to constrain the number of bids submitted by participants in the CA process, thus allow the numerical feasibility of the auction problem. Reduction of bid number is achieved via limiting the number of items (in our case channels) considered by auction participants (tenants) in their bids. Thus the aim of preallocation is to non-exclusively assign channels to tenants, which assignment serves as a basis for the later bid generation in the CA procedure. In this paper we compare the performance of various preallocation approaches via simulation according to various measures, namely the total utility of the resulting allocation, the number of unassigned channels and the required computational time. In addition to simple iterative random and semi-random algorithms which serve as baseline reference, we consider the many-to-many version of the Gale-Shapley algorithm (M2MGS) and introduce a relaxed version of the combinatorial auction algorithm (RCA) for the preallocation stage, which allows the multiple allocation of single items. Furthermore, we analyze the optimal parametrization of the M2MGS and the RCA preallocation methods, and formulate recommendations for optimal performance based on the analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2021

Preallocation-based Combinatorial Auction for Efficient Fair Channel Assignments in Multi-Connectivity Networks

We consider a general multi-connectivity framework, intended for ultra-r...
research
10/08/2018

The equivalence between two classic algorithms for the assignment problem

We give a detailed review of two algorithms that solve the minimization ...
research
10/13/2018

Maximizing Clearance Rate of Reputation-aware Auctions in Mobile Crowdsensing

Auctions have been employed as an effective framework for the management...
research
08/31/2022

Bayesian Optimization-based Combinatorial Assignment

We study the combinatorial assignment domain, which includes combinatori...
research
09/28/2020

Machine Learning-powered Iterative Combinatorial Auctions with Interval Bidding

We study the design of iterative combinatorial auctions for domains with...
research
06/11/2017

Deep Optimization for Spectrum Repacking

Over 13 months in 2016-17 the FCC conducted an "incentive auction" to re...
research
07/11/2019

A Neural Architecture for Designing Truthful and Efficient Auctions

Auctions are protocols to allocate goods to buyers who have preferences ...

Please sign up or login with your details

Forgot password? Click here to reset