A two-way dynamic adaptive pricing resource allocation model based on combinatorial double auctions in computational network

Efficient resource allocation in computing networks is essential for managing fluctuating demands and optimizing system performance. Traditional auction and pricing models often fail to adapt to diverse demands and supply–demand fluctuations, resulting in inefficiencies. This paper proposes a bidirectional price-adaptive bundled resource auction model that considers not only the autonomous adjustment of sellers’ quotations in response to supply–demand fluctuations but also the impact of these fluctuations on buyers’ willingness to pay and bidding behavior. The model integrates Combinatorial Double Auction (CDA) mechanism and Genetic Algorithm (GA), constructing a bundled resource auction mechanism that accommodates diverse resource demands and an adaptive pricing strategy that dynamically responds to real-time supply–demand variations. This approach enhances resource allocation accuracy in dynamic and competitive computing network environments. Furthermore, a reserve price mechanism and a delay compensation strategy are introduced to ensure that the proposed mechanism satisfies individual rationality, budget balance, and incentive compatibility while maintaining computational efficiency. Simulation results demonstrate that, compared to traditional methods, the proposed model not only improves allocation efficiency and enhances resource utilization but also helps reduce operational costs. Specifically, resource allocation dispersion decreases by 4.26%, while service providers’ revenue increases by 7.47%. This study provides a scalable and adaptive solution for dynamic resource allocation in cloud and edge computing platforms. It contributes significantly to the development of resource management and flexible pricing strategies in markets characterized by diverse demands and fluctuating conditions.