Auction-Based RIS Allocation With DRL: Controlling the Cost-Performance Trade-Off

• URL: http://arxiv.org/abs/2603.04433v1
• Date: Wed, 18 Feb 2026 06:22:14 GMT
• Title: Auction-Based RIS Allocation With DRL: Controlling the Cost-Performance Trade-Off
• Abstract summary: We study the allocation of reconfigurable intelligent surfaces (RISs) in a multi-cell wireless network, where base stations compete for control of shared RIS units deployed at the cell edges.<n>We integrate deep reinforcement learning (DRL) agents that learn to maximize performance while adhering to budget constraints.<n>Our results highlight the potential of combining auction-based allocation with adaptive RL mechanisms for efficient and fair utilization of RISs in next-generation wireless networks.
• Score: 2.217288163160845
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We study the allocation of reconfigurable intelligent surfaces (RISs) in a multi-cell wireless network, where base stations compete for control of shared RIS units deployed at the cell edges. These RISs, provided by an independent operator, are dynamically leased to the highest bidder using a simultaneously ascending auction format. Each base station estimates the utility of acquiring additional RISs based on macroscopic channel parameters, enabling a scalable and low-overhead allocation mechanism. To optimize the bidding behavior, we integrate deep reinforcement learning (DRL) agents that learn to maximize performance while adhering to budget constraints. Through simulations in clustered cell-edge environments, we demonstrate that reinforcement learning (RL)-based bidding significantly outperforms heuristic strategies, achieving optimal trade-offs between cost and spectral efficiency. Furthermore, we introduce a tunable parameter that governs the bidding aggressiveness of RL agents, enabling a flexible control of the trade-off between network performance and expenditure. Our results highlight the potential of combining auction-based allocation with adaptive RL mechanisms for efficient and fair utilization of RISs in next-generation wireless networks.

Related papers

• Aerial Multi-Functional RIS in Fluid Antennas-Aided Full-Duplex Networks: A Self-Optimized Hybrid Deep Reinforcement Learning Approach [4.02185297590683]
  We propose a novel autonomous aerial vehicles (AAVs) and multi-functional re-configurable surfaces (MFRISs) as intelligent surfaces (FA) AMRISs.<n>FA integrates signal, amplification, amplification, energy harvesting (EH), potentially improving signal coverage and sustainability.<n>We aim at maximizing the overall energy efficiency (EE) by jointly optimizing transmit beamforming at BS UL user power configuration of AMRIS.
  arXiv  Detail & Related papers  (2026-04-15T18:06:48Z)
• Trustworthy AI-Driven Dynamic Hybrid RIS: Joint Optimization and Reward Poisoning-Resilient Control in Cognitive MISO Networks [7.546882801190319]
  Cognitive radio networks (CRNs) are a key mechanism for alleviating spectrum scarcity by enabling secondary users (SUs) to opportunistically access licensed frequency bands without harmful interference to primary users (PUs)<n>This work introduces an adaptive, energy-aware hybrid reconfigurable intelligent surface (RIS) for underlay multiple-input single-output (MISO) CRNs.
  arXiv  Detail & Related papers  (2026-03-27T22:21:33Z)
• Cooperative Deep Reinforcement Learning for Fair RIS Allocation [2.217288163160845]
  We consider RISs as shared infrastructure that must be dynamically assigned among competing base stations.<n>We propose a fairness-aware collaborative multi-agent reinforcement learning approach.<n>Results show that the proposed framework effectively redistributes RIS resources toward weaker-performing cells.
  arXiv  Detail & Related papers  (2026-03-26T15:46:32Z)
• Large Language Models as Bidding Agents in Repeated HetNet Auction [4.305340565419997]
  This paper investigates the integration of large language models (LLMs) as reasoning agents in repeated spectrum auctions within heterogeneous networks (HetNets)<n>We propose a distributed auction-based framework in which each base station (BS) independently conducts its own multi-channel auction, and user equipments (UEs) strategically decide both their association and bid values.<n> Simulation results reveal that the LLM-empowered UE achieves consistently higher channel access frequency and improved budget efficiency compared to benchmarks.
  arXiv  Detail & Related papers  (2026-03-02T07:30:01Z)
• RISER: Orchestrating Latent Reasoning Skills for Adaptive Activation Steering [62.63376387138257]
  We propose a plug-and-play intervention framework that adaptively steers large language models (LLMs) reasoning in activation space.<n>RISER constructs a library of reusable reasoning vectors and employs a lightweight Router to dynamically compose them for each input.<n>The Router is optimized via reinforcement learning under task-level rewards, activating latent cognitive primitives in an emergent and compositional manner.
  arXiv  Detail & Related papers  (2026-01-14T08:04:33Z)
• RIS-Assisted Downlink Pinching-Antenna Systems: GNN-Enabled Optimization Approaches [51.56300276709421]
  This paper investigates a reconfigurable intelligent surface (RIS)-assisted multi-waveguide pinching-antenna (PA) system (PASS) for multi-user downlink information transmission.<n>By leveraging a graph-structured topology of the RIS-assisted PASS, a novel three-stage graph neural network (GNN) is proposed, which learns PA positions based on user locations.
  arXiv  Detail & Related papers  (2025-11-25T13:43:44Z)
• Task Specific Sharpness Aware O-RAN Resource Management using Multi Agent Reinforcement Learning [8.26664397566735]
  Next-generation networks utilize the Open Radio Access Network (O-RAN) architecture to enable dynamic resource management.<n>Deep reinforcement learning models often struggle with robustness and generalizability in dynamic environments.<n>This paper introduces a novel resource management approach that enhances the Soft Actor Critic (SAC) algorithm with Sharpness-Aware Minimization (SAM) in a distributed Multi-Agent RL (MARL) framework.
  arXiv  Detail & Related papers  (2025-11-19T00:55:24Z)
• SEQR: Secure and Efficient QR-based LoRA Routing [53.52716967527183]
  Low-Rank Adaptation (LoRA) has become a standard technique for parameter-efficient fine-tuning of large language models.<n> Efficiently selecting the correct LoRA adapter for a given input remains a challenge.<n>We introduce SEQR, an unsupervised LoRA routing algorithm designed to maximize efficiency while providing strict routing guarantees.
  arXiv  Detail & Related papers  (2025-09-22T17:59:38Z)
• Multi-Functional RIS-Enabled in SAGIN for IoT: A Hybrid Deep Reinforcement Learning Approach with Compressed Twin-Models [4.02185297590683]
  A space-air-ground integrated network (SAGIN) for the Internet of Things is investigated.<n>The MF-RIS is capable of simultaneously amplifying, and harvesting wireless energy.
  arXiv  Detail & Related papers  (2025-07-22T03:40:56Z)
• Efficient Beam Selection for ISAC in Cell-Free Massive MIMO via Digital Twin-Assisted Deep Reinforcement Learning [37.540612510652174]
  We derive the distribution of joint target detection probabilities across multiple receiving APs under false alarm rate constraints.<n>We then formulate the beam selection procedure as a Markov decision process (MDP)<n>To eliminate the high costs and associated risks of real-time agent-environment interactions, we propose a novel digital twin (DT)-assisted offline DRL approach.
  arXiv  Detail & Related papers  (2025-06-23T12:17:57Z)
• Hybrid Reinforcement Learning for Optimizing Pump Sustainability in Real-World Water Distribution Networks [55.591662978280894]
  This article addresses the pump-scheduling optimization problem to enhance real-time control of real-world water distribution networks (WDNs) Our primary objectives are to adhere to physical operational constraints while reducing energy consumption and operational costs. Traditional optimization techniques, such as evolution-based and genetic algorithms, often fall short due to their lack of convergence guarantees.
  arXiv  Detail & Related papers  (2023-10-13T21:26:16Z)
• Why So Pessimistic? Estimating Uncertainties for Offline RL through Ensembles, and Why Their Independence Matters [35.17151863463472]
  We take a renewed look at how ensembles of $Q$-functions can be leveraged as the primary source of pessimism for offline reinforcement learning (RL) We propose MSG, a practical offline RL algorithm that trains an ensemble of $Q$-functions with independently computed targets based on completely separate networks. Our experiments on the popular D4RL and RL Unplugged offline RL benchmarks demonstrate that MSG with deep ensembles surpasses highly well-tuned state-of-the-art methods by a wide margin.
  arXiv  Detail & Related papers  (2022-05-27T01:30:12Z)
• Semantic-Aware Collaborative Deep Reinforcement Learning Over Wireless Cellular Networks [82.02891936174221]
  Collaborative deep reinforcement learning (CDRL) algorithms in which multiple agents can coordinate over a wireless network is a promising approach. In this paper, a novel semantic-aware CDRL method is proposed to enable a group of untrained agents with semantically-linked DRL tasks to collaborate efficiently across a resource-constrained wireless cellular network.
  arXiv  Detail & Related papers  (2021-11-23T18:24:47Z)
• Adaptive Stochastic ADMM for Decentralized Reinforcement Learning in Edge Industrial IoT [106.83952081124195]
  Reinforcement learning (RL) has been widely investigated and shown to be a promising solution for decision-making and optimal control processes. We propose an adaptive ADMM (asI-ADMM) algorithm and apply it to decentralized RL with edge-computing-empowered IIoT networks. Experiment results show that our proposed algorithms outperform the state of the art in terms of communication costs and scalability, and can well adapt to complex IoT environments.
  arXiv  Detail & Related papers  (2021-06-30T16:49:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.