pith. sign in

arxiv: 2509.19392 · v1 · pith:FVOMD4VWnew · submitted 2025-09-22 · 💻 cs.NI · cs.GT

A User-to-User Resource Reselling Game in Open RAN with Buffer Rollover

Ruide Cao , Marie Siew , David Yau This is my paper

Pith reviewed 2026-05-22 12:05 UTC · model grok-4.3

classification 💻 cs.NI cs.GT
keywords Open RANPRB resellingNash equilibriumbuffer rolloverresource allocationgame theorynetwork slicingspectral efficiency
0
0 comments X

The pith

Users in Open RAN reach a unique stable outcome when they resell unused radio blocks to each other in a game that tracks buffer rollover.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper models users in an Open RAN network as players who can buy and resell physical resource blocks while carrying unmet demand forward through internal buffers. It formulates their choices as a non-cooperative game in which each user seeks to maximize its own payoff based on the blocks it obtains and the resulting buffer state. The central result is a proof that this game always possesses exactly one Nash equilibrium. The authors also supply an iterative bidding procedure shown to converge to that equilibrium. Simulations of the full system report 30.5 percent lower data loss and 50.7 percent lower spectrum wastage than the case with no reselling, along with higher total welfare.

Core claim

The authors claim that the user-to-user PRB reselling game, which links purchased blocks to buffer states across time slots, possesses a unique Nash equilibrium. An iterative bidding mechanism is shown to converge to this equilibrium. This setup improves efficiency in meeting heterogeneous user demands by reducing both data loss and unused resource blocks.

What carries the argument

The strategic game among users for reselling PRBs where each participant's payoff depends on its buffer state after rollover of unmet demand.

If this is right

  • The reselling game admits a unique Nash equilibrium.
  • The iterative bidding mechanism converges to that equilibrium.
  • Simulations show 30.5 percent reduction in data loss compared with no reselling.
  • Simulations show 50.7 percent reduction in spectrum wastage compared with no reselling.
  • Social welfare increases when the mechanism is used.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The buffer-rollover idea could be applied to reselling other scarce resources such as computing cycles at the network edge.
  • Real-world O-RAN testbeds would be needed to check whether the simulated efficiency gains survive imperfect information and signaling delays.
  • Allowing the network operator to set base prices for initial PRB allocation might further improve the overall outcome beyond user-only trading.
  • Similar games could be studied for multi-hop reselling chains among more than two users.

Load-bearing premise

Users' internal buffer states relate to the PRBs they purchase in a way that lets each one strategically maximize its individual payoff inside the non-cooperative game.

What would settle it

If the bidding process fails to converge or produces more than one stable outcome when users face repeated demand patterns drawn from the same distributions, the uniqueness and convergence claims would be falsified.

Figures

Figures reproduced from arXiv: 2509.19392 by David Yau, Marie Siew, Ruide Cao.

Figure 2
Figure 2. Figure 2: Time Slot. Each user maintains the role within the time slot after the Choose Role phase, and can switch roles across different time slots. the service capacity from RBs exceeds the total data present in the buffer: w t i = (f t i a t i −c t i −o t i ) + (i.e., RBs not used). Users aim to minimize their data loss, i.e., avoid buffer overflow. We measure user satisfaction with the transmission process using… view at source ↗
Figure 3
Figure 3. Figure 3: Convergence process in iterative bidding. A total of 130 rounds of bidding occurred throughout the process. The step size δ is set to 10−7 , and the initial price is set to 1.095. During the first 20 rounds of bidding, the market price quickly reduced to 1.06 units. And over the next 110 rounds of bidding, the price falls more and more slowly, until it finally converges to a market-clearing price of about … view at source ↗
Figure 4
Figure 4. Figure 4: Empty buffer and willingness trends. Lines in different colors correspond to the trends of different users. The willingness to buy value shows a high correlation with the user’s current buffer availability. The emptier the user’s buffer, the lower the willingness to buy. When the buffer is empty, the user’s willingness to buy is minimized. When the buffer is full, the user’s willingness to buy is high and … view at source ↗
read the original abstract

The development of the Open RAN (O-RAN) framework helps enable network slicing through its virtualization, interoperability, and flexibility. To improve spectral efficiency and better meet users' dynamic and heterogeneous service demands, O-RAN's flexibility further presents an opportunity for resource reselling of unused physical resource blocks (PRBs) across users. In this work, we propose a novel game-based user-to-user PRB reselling model in the O-RAN setting, which models the carryover of unmet demand across time slots, along with how users' internal buffer states relate to any PRBs purchased. We formulate the interplay between the users as a strategic game, with each participant aiming to maximize their own payoffs, and we prove the existence and uniqueness of the Nash equilibrium (NE) in the game. We furthermore propose an iterative bidding mechanism that converges to this NE. Extensive simulations show that our best approach reduces data loss by 30.5% and spectrum resource wastage by 50.7% while significantly improving social welfare, compared to its absence.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes a novel user-to-user PRB reselling game in Open RAN that incorporates buffer rollover for unmet demand across time slots. It formulates this as a non-cooperative game, proves the existence and uniqueness of the Nash equilibrium, and introduces an iterative bidding mechanism claimed to converge to this equilibrium. Simulations are used to show reductions in data loss by 30.5% and spectrum resource wastage by 50.7%, along with improvements in social welfare.

Significance. If the theoretical claims regarding the unique Nash equilibrium and the convergence of the bidding mechanism hold under the buffer rollover dynamics, this work could advance resource management in O-RAN by enabling efficient reselling among users with dynamic demands. The reported simulation improvements indicate potential practical value in reducing data loss and wastage, though the strength depends on rigorous verification of the game-theoretic properties.

major comments (2)
  1. [§4 (Nash Equilibrium Analysis)] §4 (Nash Equilibrium Analysis): The proof of existence and uniqueness of the pure-strategy NE assumes quasi-concavity and continuity of the users' payoff functions. However, the buffer rollover linkage (where internal buffer state in slot t depends on unmet demand and PRBs purchased in t-1) can introduce non-concave segments or discontinuities at saturation thresholds, violating the conditions needed for a single-valued best-response correspondence. No lemma or explicit check of these regularity conditions is provided, which is load-bearing for the uniqueness claim.
  2. [§5 (Iterative Bidding Mechanism)] §5 (Iterative Bidding Mechanism): The mechanism is stated to converge to the NE, but the convergence argument does not address how the state-dependent payoffs (via rollover carry-over) affect the contraction property or monotonicity of the best-response dynamics. Without this, the convergence guarantee remains unsupported by the given analysis.
minor comments (2)
  1. [Abstract] The abstract refers to 'our best approach' in the simulation results without clarifying which of the compared schemes this denotes.
  2. [Model Formulation] A consolidated table of notation for buffer states, PRB allocations, and payoff components would improve readability of the model formulation.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed comments on our manuscript. We have reviewed the concerns regarding the regularity conditions for the Nash equilibrium and the convergence analysis of the iterative bidding mechanism. We address each point below and indicate planned revisions to strengthen the theoretical foundations.

read point-by-point responses

  1. Referee: [§4 (Nash Equilibrium Analysis)] §4 (Nash Equilibrium Analysis): The proof of existence and uniqueness of the pure-strategy NE assumes quasi-concavity and continuity of the users' payoff functions. However, the buffer rollover linkage (where internal buffer state in slot t depends on unmet demand and PRBs purchased in t-1) can introduce non-concave segments or discontinuities at saturation thresholds, violating the conditions needed for a single-valued best-response correspondence. No lemma or explicit check of these regularity conditions is provided, which is load-bearing for the uniqueness claim.

    Authors: We agree that the buffer rollover introduces state dependencies that require explicit verification to ensure the payoff functions satisfy the necessary conditions for a unique pure-strategy NE. The original analysis in Section 4 derives quasi-concavity from the per-slot utility structure with linear rollover carry-over, but we acknowledge the absence of a dedicated check for potential discontinuities at saturation thresholds. In the revised version, we will insert a new Lemma 4.1 that formally proves continuity and quasi-concavity of the payoff functions under rollover by bounding the buffer state transitions and showing that any threshold effects preserve the single-valued best-response property. This addition will directly support the uniqueness claim. revision: yes

  2. Referee: [§5 (Iterative Bidding Mechanism)] §5 (Iterative Bidding Mechanism): The mechanism is stated to converge to the NE, but the convergence argument does not address how the state-dependent payoffs (via rollover carry-over) affect the contraction property or monotonicity of the best-response dynamics. Without this, the convergence guarantee remains unsupported by the given analysis.

    Authors: We concur that the convergence argument in Section 5 must explicitly incorporate the effects of state-dependent payoffs arising from buffer rollover. The existing proof assumes contraction mapping on the strategy space but does not detail how carry-over terms influence monotonicity or the contraction constant. We will revise Section 5 to augment the analysis with the buffer state as part of an extended state space, demonstrating that the iterative bidding updates remain contractive and monotone for finite buffer capacities and bounded demand realizations. This will provide a rigorous convergence guarantee to the NE. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation applies standard game theory to a novel model

full rationale

The paper introduces a new user-to-user PRB reselling game that incorporates buffer rollover dynamics and internal buffer states as part of the payoff formulation. It then invokes standard results on existence and uniqueness of Nash equilibrium for strategic games with compact strategy sets and quasi-concave continuous utilities. No load-bearing step reduces by construction to a fitted parameter, self-citation chain, or renamed prior result; the model elements (buffer carry-over linkage, iterative bidding) are presented as original and the equilibrium claims rest on the explicit game definition rather than circular re-use of the target quantities.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard game-theoretic assumptions about rational payoff maximization and a domain-specific modeling choice that buffer states link directly to PRB value across slots; no free parameters or invented entities are stated in the abstract.

axioms (2)
  • domain assumption Users act as rational strategic players each maximizing their individual payoffs in the reselling game
    Invoked when the paper formulates the interplay between users as a strategic game.
  • domain assumption Buffer states relate to purchased PRBs such that unmet demand carries over across time slots
    Stated as part of the model that incorporates carryover of unmet demand.

pith-pipeline@v0.9.0 · 5715 in / 1427 out tokens · 76464 ms · 2026-05-22T12:05:50.173578+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

  • IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    We formulate the interplay between the users as a strategic game... prove the existence and uniqueness of the Nash equilibrium (NE) in the game... approximate utility functions ˆU and ˇU... Problem P1 is a strictly convex problem, where a unique optimal solution exists... first-order optimality conditions of P1 are equivalent to the NE

  • IndisputableMonolith/Foundation/BranchSelection.lean branch_selection unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    utility function U^t_i(·) ... strictly decreases with respect to the loss l^t_i ... concave ... continuously differentiable

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

14 extracted references · 14 canonical work pages

  1. [1]

    Under- standing o-ran: Architecture, interfaces, algorithms, security, and re- search challenges,

    M. Polese, L. Bonati, S. D’oro, S. Basagni, and T. Melodia, “Under- standing o-ran: Architecture, interfaces, algorithms, security, and re- search challenges,” IEEE Communications Surveys & Tutorials, vol. 25, no. 2, pp. 1376–1411, 2023

    work page 2023

  2. [2]

    Open ran slicing for mvnos with deep reinforcement learning,

    A. Filali, Z. Mlika, and S. Cherkaoui, “Open ran slicing for mvnos with deep reinforcement learning,” IEEE Internet of Things Journal , vol. 11, no. 10, pp. 18 711–18 725, 2024

    work page 2024

  3. [3]

    Resource allocation in an open ran system using network slicing,

    M. K. Motalleb, V . Shah-Mansouri, S. Parsaeefard, and O. L. A. L ´opez, “Resource allocation in an open ran system using network slicing,” IEEE Transactions on Network and Service Management, vol. 20, no. 1, pp. 471–485, 2022

    work page 2022

  4. [4]

    Poster: A novel region-of-interest based uav planning strategy for mitigating urban peak demand,

    R. Cao, J. Ye, Q. You, J. Xu, Y . Wang, S. Jiang, and Y . Li, “Poster: A novel region-of-interest based uav planning strategy for mitigating urban peak demand,” in MobiHoc. ACM, 2023, pp. 300–301

    work page 2023

  5. [5]

    An adaptive uav scheduling process to address dynamic mobile network demand efficiently,

    R. Cao, J. Ye, J. Zhang, Q. You, C. Tang, Y . Liu, and Y . Wang, “An adaptive uav scheduling process to address dynamic mobile network demand efficiently,” in DATE. IEEE, 2024, pp. 1–6

    work page 2024

  6. [6]

    Towards effective resource procurement in mec: A resource re- selling framework,

    M. Siew, S. Sharma, K. Guo, D. Cai, W. Wen, C. Joe-Wong, and T. Q. Quek, “Towards effective resource procurement in mec: A resource re- selling framework,” IEEE Transactions on Services Computing, vol. 17, no. 1, pp. 82–97, 2023

    work page 2023

  7. [7]

    Double-sided bidding mechanism for resource sharing in mobile cloud,

    L. Tang, S. He, and Q. Li, “Double-sided bidding mechanism for resource sharing in mobile cloud,” IEEE Transactions on vehicular technology, vol. 66, no. 2, pp. 1798–1809, 2016

    work page 2016

  8. [8]

    A game theoretic approach to vehicle-to- grid scheduling,

    X. Chen and K.-C. Leung, “A game theoretic approach to vehicle-to- grid scheduling,” in 2018 IEEE GLOBECOM . IEEE, 2018, pp. 1–6

    work page 2018

  9. [9]

    Mobile data trading: Behavioral economics analysis and algorithm design,

    J. Yu, M. H. Cheung, J. Huang, and H. V . Poor, “Mobile data trading: Behavioral economics analysis and algorithm design,” IEEE journal on selected areas in communications , vol. 35, no. 4, pp. 994–1005, 2017

    work page 2017

  10. [10]

    Dynamic pricing for resource- quota sharing in multi-access edge computing,

    M. Siew, D. Cai, L. Li, and T. Q. Quek, “Dynamic pricing for resource- quota sharing in multi-access edge computing,” IEEE Transactions on Network Science and Engineering , vol. 7, no. 4, pp. 2901–2912, 2020

    work page 2020

  11. [11]

    Economic viability of data trading with rollover,

    Z. Wang, L. Gao, J. Huang, and B. Shou, “Economic viability of data trading with rollover,” in INFOCOM. IEEE, 2019, pp. 1846–1854

    work page 2019

  12. [12]

    5G; NR; user equipment (ue) radio transmission and reception; part 1: Range 1 standalone (3gpp ts 38.101-1 version 18.6.0 release 18),

    3GPP, “5G; NR; user equipment (ue) radio transmission and reception; part 1: Range 1 standalone (3gpp ts 38.101-1 version 18.6.0 release 18),” 3GPP, Technical Specification TS 38.101-1, Aug 2024

    work page 2024

  13. [13]

    Dynamic source routing in ad hoc wireless networks,

    D. B. Johnson and D. A. Maltz, “Dynamic source routing in ad hoc wireless networks,” in Mobile computing. Springer, 1996, pp. 153–181

    work page 1996

  14. [14]

    Complexity measures for iot network traffic,

    L. Liu, D. Essam, and T. Lynar, “Complexity measures for iot network traffic,” IEEE Internet of Things Journal , vol. 9, no. 24, pp. 25 715– 25 735, 2022

    work page 2022