pith. machine review for the scientific record. sign in

arxiv: 2604.03897 · v1 · submitted 2026-04-04 · 💻 cs.GT · cs.AI· cs.NI

Recognition: 2 theorem links

· Lean Theorem

Latency-Aware Resource Allocation over Heterogeneous Networks: A Lorentz-Invariant Market Mechanism

Saad Alqithami
Authors on Pith no claims yet

Pith reviewed 2026-05-13 16:41 UTC · model grok-4.3

classification 💻 cs.GT cs.AIcs.NI
keywords auction mechanismresource allocationheterogeneous networkslatency awarenesstruthful biddingwelfare maximizationcausal ordering
0
0 comments X

The pith

A Lorentz-invariant auction allocates bandwidth and slots in delay-heterogeneous networks by reweighting bids according to causal horizon slack.

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

The paper presents the Lorentz-Invariant Auction as a mechanism for allocating resources across networks whose delays range from LEO satellites to deep-space relays. Bids are treated as spacetime events and corrected by an exponential factor derived from the earliest arrival time relative to a public clearing horizon. Under the assumption of fixed feasible slacks supplied by trusted infrastructure, the mechanism is individually rational and guarantees welfare at least e to the minus lambda times the slack spread relative to the optimal feasible allocation. A reader would care because the approach avoids the need for global clock synchronization or buffering while preserving truthfulness once slacks are fixed.

Core claim

Under fixed feasible slacks, the Lorentz-Invariant Auction is individually rational and achieves welfare at least e^{-λΔ} relative to the optimal feasible allocation, where Δ is the slack spread. The exponential correction follows directly from a semigroup-style invariance axiom applied to the causal ordering of bids viewed as spacetime events. The mechanism is implemented via critical-value payments that make truthful reporting dominant once slacks are exogenous.

What carries the argument

Lorentz-Invariant Auction (LIA), which reweights reported values by an exponential function of horizon slack derived from earliest-arrival times under a causal-ordering formulation.

If this is right

  • On Starlink-like and terrestrial Internet networks the mechanism maintains near-efficiency while removing measured timing rents.
  • On deep-space networks welfare starts lower in thin markets but rises as market depth increases.
  • Winner-determination time remains separate from the background cost of maintaining slack estimates.
  • Robustness holds under both iid noise and structured models including distance-biased and subnetwork-correlated errors.

Where Pith is reading between the lines

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

  • The same causal-invariance structure could be tested in other latency-sensitive allocation domains such as edge computing or vehicular networks.
  • If a reliable endogenous procedure for slack estimation can be added without violating individual rationality, the mechanism would no longer require trusted infrastructure.
  • The exponential form of the correction suggests possible extensions to settings where multiplicative factors arise from repeated causal interactions.

Load-bearing premise

The analysis assumes that feasible slacks are fixed and supplied by trusted infrastructure rather than estimated from bids or computed endogenously.

What would settle it

A controlled experiment or trace-driven simulation in which slack estimation error exceeds the bounded regime analyzed, or in which slacks must be derived from reported bids, would show whether the e^{-λΔ} welfare guarantee continues to hold.

Figures

Figures reproduced from arXiv: 2604.03897 by Saad Alqithami.

Figure 1
Figure 1. Figure 1: Spacetime view of two bids. Dashed lines are light-cone boundaries under unit aspect ( [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Latency-Arbitrage Index (LAI) curves g(∆) for STARLINK-200 and INTERNET-100 at n = 50 (log scale). For each mechanism, g(∆) measures the expected utility gain from reducing a bidder’s one-way propagation delay by ∆. Fast-VCG exhibits large timing rents that grow with ∆, frequent batch auctions reduce timing rents only by imposing buffering, and LIA drives the curve to zero (within estimator resolution) whi… view at source ↗
Figure 3
Figure 3. Figure 3: Empirical evaluat min–max across topologies; [PITH_FULL_IMAGE:figures/full_fig_p025_3.png] view at source ↗
read the original abstract

We present a telecom-native auction mechanism for allocating bandwidth and time slots across heterogeneous-delay networks, ranging from low-Earth-orbit (LEO) satellite constellations to delay-tolerant deep-space relays. The Lorentz-Invariant Auction (LIA) treats bids as spacetime events and reweights reported values based on the \emph{horizon slack}, a causal quantity derived from the earliest-arrival times relative to a public clearing horizon. Unlike other delay-equalization rules, LIA combines a causal-ordering formulation, a uniquely exponential slack correction implied by a semigroup-style invariance axiom, and a critical-value implementation that ensures truthful reported values once slacks are fixed by trusted infrastructure. We analyze the incentive result in the exogenous-slack regime and separately examine bounded slack-estimation error and endogenous-delay limitations. Under fixed feasible slacks, LIA is individually rational and achieves welfare at least \(e^{-\lambda\Delta}\) relative to the optimal feasible allocation, where \(\Delta\) is the slack spread. We evaluate LIA on STARLINK-200, INTERNET-100, and DSN-30 across 52,500 baseline instances with market sizes \(n\in\{10,20,30,40,50\}\) and conduct additional robustness sweeps. On Starlink and Internet, LIA maintains near-efficiency while eliminating measured timing rents. However, on DSN, welfare is lower in thin markets but improves with depth. We also distinguish winner-determination time from the background cost of maintaining slack estimates and study robustness beyond independent and identically distributed (iid) noise through error-spread bounds and structured (distance-biased and subnetwork-correlated) noise models. These results suggest that causal-consistent mechanism design offers a practical non-buffering alternative to synchronized delay equalization in heterogeneous telecom infrastructures.

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

1 major / 2 minor

Summary. The paper proposes the Lorentz-Invariant Auction (LIA) for allocating bandwidth and time slots in heterogeneous-delay networks (LEO satellites to deep-space relays). Bids are modeled as spacetime events and reweighted via horizon slack, a causal quantity from earliest-arrival times relative to a public clearing horizon. The mechanism applies an exponential slack correction derived from a semigroup-style invariance axiom, implements critical-value payments, and claims individual rationality plus welfare at least e^{-λΔ} relative to the optimal feasible allocation under fixed feasible slacks (where Δ is the slack spread). Simulations on STARLINK-200, INTERNET-100, and DSN-30 across 52,500 instances with n up to 50 show near-efficiency and elimination of timing rents on some networks but lower welfare on DSN in thin markets.

Significance. If the central claims hold, the work provides a novel causal-consistent mechanism design framework for latency-aware resource allocation that avoids buffering by leveraging Lorentz invariance and semigroup axioms. The extensive empirical evaluation across realistic network topologies and market sizes, plus the separation of winner-determination time from slack-maintenance costs, offers practical insights for telecom infrastructures. The approach could influence delay-tolerant network design if the invariance axiom and resulting bounds are rigorously justified.

major comments (1)
  1. [Abstract and invariance axiom section] Abstract and the section introducing the invariance axiom: the claim of a 'uniquely exponential slack correction implied by a semigroup-style invariance axiom' is load-bearing for the e^{-λΔ} welfare bound, yet the text does not derive the axiom from Lorentz invariance or causal ordering alone, nor demonstrate uniqueness of the exponential form (other functions such as linear or power-law corrections may satisfy the same invariance). This leaves the specific bound as potentially an artifact of the modeling choice rather than a necessary consequence.
minor comments (2)
  1. [Abstract and analysis sections] The status of λ and Δ (fitted versus derived) should be clarified explicitly, as the welfare bound depends on them and the reader's note indicates potential circularity in the slack definition.
  2. [Evaluation section] Simulation details on error-spread bounds, structured noise models, and how slack estimates are obtained in the 52,500 instances could be expanded for reproducibility, though the distinction between winner-determination time and background slack costs is a positive point.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their constructive comments on our manuscript. We address the major comment below and will revise the paper to strengthen the presentation of the invariance axiom and its implications for the welfare bound.

read point-by-point responses

  1. Referee: [Abstract and invariance axiom section] Abstract and the section introducing the invariance axiom: the claim of a 'uniquely exponential slack correction implied by a semigroup-style invariance axiom' is load-bearing for the e^{-λΔ} welfare bound, yet the text does not derive the axiom from Lorentz invariance or causal ordering alone, nor demonstrate uniqueness of the exponential form (other functions such as linear or power-law corrections may satisfy the same invariance). This leaves the specific bound as potentially an artifact of the modeling choice rather than a necessary consequence.

    Authors: We agree that the current text presents the semigroup-style invariance axiom as motivated by Lorentz invariance and causal ordering but does not provide an explicit derivation or uniqueness proof within the main sections. The axiom is intended to capture the requirement that slack corrections compose consistently under the semigroup operation induced by delay addition in spacetime, which is a direct consequence of the partial order on events. In the revision, we will add a dedicated subsection deriving the axiom from the causal ordering and semigroup properties, and solve the resulting functional equation to show that the exponential form is the unique continuous solution satisfying the invariance. We will also include a brief argument why linear and power-law alternatives violate the composition property under the Lorentz-invariant metric. This will make clear that the e^{-λΔ} bound follows necessarily from the axiom rather than from an arbitrary modeling choice. The simulations and other results remain unchanged. revision: yes

Circularity Check

1 steps flagged

Exponential welfare bound follows by construction from the posited semigroup invariance axiom and exponential slack correction

specific steps
  1. self definitional [Abstract]
    "LIA combines a causal-ordering formulation, a uniquely exponential slack correction implied by a semigroup-style invariance axiom, and a critical-value implementation that ensures truthful reported values once slacks are fixed by trusted infrastructure. [...] Under fixed feasible slacks, LIA is individually rational and achieves welfare at least e^{-λΔ} relative to the optimal feasible allocation, where Δ is the slack spread."

    The welfare lower bound e^{-λΔ} is obtained by reweighting bids with the exponential slack correction; once the correction is defined to be exponential (via the axiom), the bound holds by direct substitution and does not require additional derivation from Lorentz invariance. The claim of uniqueness for the exponential form is asserted without exhibiting why other functional forms satisfying the same invariance would be excluded.

full rationale

The paper defines LIA using a 'uniquely exponential slack correction implied by a semigroup-style invariance axiom' and then states that this yields welfare at least e^{-λΔ}. The bound is a direct algebraic consequence of the exponential reweighting chosen to satisfy the axiom; the text does not derive the exponential form from Lorentz invariance or causal ordering alone, nor demonstrate uniqueness among functions satisfying the axiom. This makes the quantitative guarantee an artifact of the modeling choice rather than an independent first-principles prediction. The rest of the mechanism (critical-value payments, individual rationality under fixed slacks) remains non-circular.

Axiom & Free-Parameter Ledger

2 free parameters · 1 axioms · 1 invented entities

The central claim rests on an invariance axiom that forces the exponential form of the slack correction and on the definition of horizon slack as a new causal quantity derived from arrival times.

free parameters (2)
  • λ
    Scaling parameter appearing in the welfare bound e^{-λΔ}
  • Δ
    Slack spread used in the welfare guarantee
axioms (1)
  • ad hoc to paper semigroup-style invariance axiom
    Invoked to derive the uniquely exponential slack correction
invented entities (1)
  • horizon slack no independent evidence
    purpose: Causal quantity used to reweight bids based on earliest-arrival times relative to a public clearing horizon
    New derived quantity central to the reweighting step

pith-pipeline@v0.9.0 · 5617 in / 1377 out tokens · 56038 ms · 2026-05-13T16:41:55.424021+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 echoes
    ?
    echoes

    ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

    Theorem 1 (Uniqueness of exponential discount). ... By continuity and the functional equation ϕ(x+y)=ϕ(x)ϕ(y), we have ϕ(δ)=e^{f(δ)} ... The only continuous solutions to Cauchy's functional equation are f(δ)=cδ ... so ϕ(δ)=e^{-λδ}

  • IndisputableMonolith/Foundation/AxiomDischargePlan.lean aczel_kannappan_via_cases echoes
    ?
    echoes

    ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

    Table 3: Comparison of candidate discount functions ... Only the exponential form satisfies all requirements for a causal-consistent pricing rule.

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

47 extracted references · 47 canonical work pages

  1. [1]

    On the electrodynamics of moving bodies,

    A. Einstein, “On the electrodynamics of moving bodies,”Annalen der Physik, vol. 17, no. 10, pp. 891–921, 1905

    work page 1905

  2. [2]

    Space and time,

    H. Minkowski, “Space and time,” inThe Principle of Relativity: A Collection of Original Memoirs on the Special and General Theory of Relativity, Dover, 1952, pp. 75–91

    work page 1952

  3. [3]

    Time, clocks, and the ordering of events in a distributed system,

    L. Lamport, “Time, clocks, and the ordering of events in a distributed system,”Communications of the ACM, vol. 21, no. 7, pp. 558–565, 1978

    work page 1978

  4. [4]

    Multipart pricing of public goods,

    E. H. Clarke, “Multipart pricing of public goods,”Public Choice, vol. 11, no. 1, pp. 17–33, 1971

    work page 1971

  5. [5]

    Optimal auction design,

    R. B. Myerson, “Optimal auction design,”Mathematics of Operations Research, vol. 6, no. 1, pp. 58–73, 1981

    work page 1981

  6. [6]

    Delay is not an option: Low latency routing in space,

    M. Handley, “Delay is not an option: Low latency routing in space,”Proceedings of the 17th ACM Workshop on Hot Topics in Networks, pp. 85–91, 2018

    work page 2018

  7. [7]

    The high-frequency trading arms race: Frequent batch auctions as a market design response,

    E. Budish, P. Cramton, and J. Shim, “The high-frequency trading arms race: Frequent batch auctions as a market design response,”The Quarterly Journal of Economics, vol. 130, no. 4, pp. 1547–1621, 2015

    work page 2015

  8. [8]

    Detecting causal relationships in distributed computations: In search of the holy grail,

    R. Schwarz and F. Mattern, “Detecting causal relationships in distributed computations: In search of the holy grail,”Distributed Computing, vol. 7, no. 3, pp. 149–174, 1994

    work page 1994

  9. [9]

    Settling the Communication Complexity of VCG-Based Mechanisms for All Approximation Guarantees,

    F. Qiu and S. M. Weinberg, “Settling the Communication Complexity of VCG-Based Mechanisms for All Approximation Guarantees,” inProceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, pp. 1192–1203

    work page 2024

  10. [10]

    AI-Powered Trading, Algorithmic Collusion, and Price Efficiency,

    W. W. Dou, I. Goldstein, and Y . Ji, “AI-Powered Trading, Algorithmic Collusion, and Price Efficiency,”NBER Working Paper Series, no. 34054, 2025

    work page 2025

  11. [11]

    Do speed bumps curb low-latency investment? Evidence from a laboratory market,

    M. Khapko and M. Zoican, “Do speed bumps curb low-latency investment? Evidence from a laboratory market,” Journal of Financial Markets, vol. 55, pp. 100601, 2021

    work page 2021

  12. [12]

    Tech diplomacy and Critical Technologies: Case of the LEO satellite internet,

    K. D. Remili, N. Bouzourine, R. Hartani, and A. Belouchrani, “Tech diplomacy and Critical Technologies: Case of the LEO satellite internet,”Telecommunications Policy, vol. 49, no. 4, pp. 102947, 2025

    work page 2025

  13. [13]

    Scalable routing in low-Earth orbit satellite constellations: Architecture and algo- rithms,

    S. Zhang and K. L. Yeung, “Scalable routing in low-Earth orbit satellite constellations: Architecture and algo- rithms,”Computer Communications, vol. 188, pp. 26–38, 2022

    work page 2022

  14. [14]

    Routing in future space-terrestrial integrated networks with SATNET-OSPF,

    H. Yan, L. Qiao, W. Wu, J. A. Fraire, D. Zhou, L. Li, and Y . Xu, “Routing in future space-terrestrial integrated networks with SATNET-OSPF,”International Journal of Satellite Communications and Networking, vol. 42, no. 1, pp. 1–25, 2024

    work page 2024

  15. [15]

    Delay-tolerant networking: an approach to interplanetary Internet,

    S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V . Cerf, B. Durst, K. Scott, and H. Weiss, “Delay-tolerant networking: an approach to interplanetary Internet,”IEEE Communications Magazine, vol. 41, no. 6, pp. 128–136, 2003. 30 LiA

    work page 2003

  16. [16]

    Byzantine Fault-Tolerant Consensus Algorithms: A Survey,

    W. Zhong, C. Yang, W. Liang, J. Cai, L. Chen, J. Liao, and N. Xiong, “Byzantine Fault-Tolerant Consensus Algorithms: A Survey,”Electronics, vol. 12, no. 18, pp. 3801, 2023

    work page 2023

  17. [17]

    On Designing Distributed Auction Mechanisms for Wireless Spectrum Allocation,

    S. Yang, D. Peng, T. Meng, F. Wu, G. Chen, S. Tang, Z. Li, and T. Luo, “On Designing Distributed Auction Mechanisms for Wireless Spectrum Allocation,”IEEE Transactions on Mobile Computing, vol. 18, no. 9, pp. 2129–2146, 2019

    work page 2019

  18. [18]

    SPORE: combining symmetry and partial order reduction,

    M. Kokologiannakis, I. Marmanis, and V . Vafeiadis, “SPORE: combining symmetry and partial order reduction,” Proceedings of the ACM on Programming Languages, vol. 8, no. PLDI, pp. 1781–1803, 2024

    work page 2024

  19. [19]

    Relativistic computers and the Turing barrier,

    I. Németi and G. Dávid, “Relativistic computers and the Turing barrier,”Applied Mathematics and Computation, vol. 178, no. 1, pp. 118–142, 2006

    work page 2006

  20. [20]

    General relativistic hypercomputing and foundation of mathematics,

    H. Andréka, I. Németi, and P. Németi, “General relativistic hypercomputing and foundation of mathematics,” Natural Computing, vol. 8, no. 3, pp. 499–516, 2009

    work page 2009

  21. [21]

    Fundamental physics and computation: The physics of reversible computation,

    M. P. Frank, “Fundamental physics and computation: The physics of reversible computation,”Philosophical Transactions of the Royal Society A, vol. 378, no. 2164, pp. 20190062, 2020

    work page 2020

  22. [22]

    An invitation to quantum game theory,

    E. W. Piotrowski and J. Sładkowski, “An invitation to quantum game theory,”International Journal of Theoretical Physics, vol. 42, no. 5, pp. 1089–1099, 2003

    work page 2003

  23. [23]

    Internet X.509 Public Key Infrastructure Time-Stamp Protocol (TSP),

    R. Zuccherato, P. Cain, C. Adams, and D. Pinkas, “Internet X.509 Public Key Infrastructure Time-Stamp Protocol (TSP),” IETF RFC 3161, 2001

    work page 2001

  24. [24]

    Delay-Tolerant Networking Architecture,

    L. Torgerson, S. C. Burleigh, H. Weiss, A. J. Hooke, K. Fall, V . Cerf, K. Scott, and R. C. Durst, “Delay-Tolerant Networking Architecture,” IETF RFC 4838, 2007

    work page 2007

  25. [25]

    Network Time Protocol Version 4: Protocol and Algorithms Specification,

    J. Martin, J. Burbank, W. Kasch, and D. L. Mills, “Network Time Protocol Version 4: Protocol and Algorithms Specification,” IETF RFC 5905, 2010

    work page 2010

  26. [26]

    Network Time Security for the Network Time Protocol,

    D. F. Franke, D. Sibold, K. Teichel, M. Dansarie, and R. Sundblad, “Network Time Security for the Network Time Protocol,” IETF RFC 8915, 2020

    work page 2020

  27. [27]

    Bundle Protocol Version 7,

    S. Burleigh, K. Fall, and E. J. Birrane, “Bundle Protocol Version 7,” IETF RFC 9171, 2022

    work page 2022

  28. [28]

    IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems,

    IEEE, “IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems,” IEEE Std 1588-2019, 2019

    work page 2019

  29. [29]

    Timestamps in message-passing systems that preserve the partial ordering,

    C. J. Fidge, “Timestamps in message-passing systems that preserve the partial ordering,” inProceedings of the 11th Australian Computer Science Conference (ACSC), pp. 56–66, 1988

    work page 1988

  30. [30]

    Virtual time and global states of distributed systems,

    F. Mattern, “Virtual time and global states of distributed systems,” inParallel and Distributed Algorithms, M. Cosnardet al., Eds. Amsterdam, The Netherlands: North-Holland, 1989, pp. 215–226

    work page 1989

  31. [31]

    Optimal dynamic partial order reduction,

    P. A. Abdulla, S. Aronis, B. Jonsson, and K. Sagonas, “Optimal dynamic partial order reduction,” inProceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL ’14), 2014, pp. 373–384

    work page 2014

  32. [32]

    Detecting dynamical causality via intervened reservoir computing,

    J. Zhao, Z. Gan, R. Huang, C. Guan, J. Shi, and S. Leng, “Detecting dynamical causality via intervened reservoir computing,”Communications Physics, vol. 7, Art. no. 232, 2024

    work page 2024

  33. [33]

    A systematic literature review on auction mechanisms: Insights from the last decade and future directions,

    A. M. Felicetti, M. Luzzi, S. Ammirato, and F. Guerriero, “A systematic literature review on auction mechanisms: Insights from the last decade and future directions,”Journal of Economic Surveys, vol. 39, no. 5, pp. 1971–1998, 2025

    work page 1971

  34. [34]

    Quantifying the high-frequency trading ‘arms race’,

    M. Aquilina, E. Budish, and P. O’Neill, “Quantifying the high-frequency trading ‘arms race’,”The Quarterly Journal of Economics, vol. 137, no. 1, pp. 493–564, 2022

    work page 2022

  35. [35]

    A novel space-based hosting approach for ultra low latency web services,

    D. Dalai, S. Babu, V . B. Sukumaran, and B. S. Manoj, “A novel space-based hosting approach for ultra low latency web services,”IEEE Access, vol. 12, pp. 142838–142862, 2024

    work page 2024

  36. [36]

    Improved dynamic Byzantine fault tolerant consensus mechanism,

    F. Tang, J. Peng, P. Wang, H. Zhu, and T. Xu, “Improved dynamic Byzantine fault tolerant consensus mechanism,” Computer Communications, vols. 226–227, Art. no. 107922, 2024

    work page 2024

  37. [37]

    Roughtime,

    W. Ladd and M. Dansarie, “Roughtime,” IETF Internet-Draftdraft-ietf-ntp-roughtime-17, work in progress, Feb. 2026

    work page 2026

  38. [38]

    A multifaceted look at Starlink performance,

    N. Mohan, A. E. Ferguson, H. Cech, R. Bose, P. R. Renatin, M. K. Marina, and J. Ott, “A multifaceted look at Starlink performance,” inProceedings of the ACM Web Conference (WWW ’24), 2024, pp. 2723–2734

    work page 2024

  39. [39]

    Relativistic Asset Pricing: A Formal Treatment (Part I),

    D. Cheah, “Relativistic Asset Pricing: A Formal Treatment (Part I),” SSRN working paper 5693543, Nov. 2025

    work page 2025

  40. [40]

    Frequent batch auction versus continuous time auction under order cancellation and maker-taker fee,

    H. Ge and H. Yang, “Frequent batch auction versus continuous time auction under order cancellation and maker-taker fee,”International Journal of Finance & Economics, vol. 30, no. 1, pp. 570–589, 2025. 31 LiA

    work page 2025

  41. [41]

    Incentive mechanism design for resource management in satellite networks: A comprehensive survey,

    N. C. Luong, Z. Sui, D. V . Le, J. Cao, B. Ma, N. D. Hai, R. Zhang, V . V . Quang, D. Niyato, and S. Feng, “Incentive mechanism design for resource management in satellite networks: A comprehensive survey,” arXiv preprint arXiv:2601.03757, 2026

    work page arXiv 2026

  42. [42]

    A detailed characterization of Starlink one-way delay,

    J. Garcia, S. Sundberg, and A. Brunström, “A detailed characterization of Starlink one-way delay,” inProceedings of the 2025 3rd Workshop on LEO Networking and Communication (LEO-NET ’25), 2025, pp. 43–49

    work page 2025

  43. [43]

    Statistical characterization and prediction of E2E latency over LEO satellite networks,

    A. Casparsen, J. E. Jakobsen, J. J. Nielsen, P. Popovski, and I. L. Mayorga, “Statistical characterization and prediction of E2E latency over LEO satellite networks,” arXiv preprint arXiv:2601.08439, 2026

    work page arXiv 2026

  44. [44]

    A truthful mechanism design for distributed optimisation algorithms in networks with self-interested agents,

    T. Zhong and D. Angeli, “A truthful mechanism design for distributed optimisation algorithms in networks with self-interested agents,”Automatica, vol. 184, Art. no. 112727, 2026

    work page 2026

  45. [45]

    Rethinking strategic mechanism design in the age of large language models: New directions for communication systems,

    I. Lotfi, N. Alabbasi, and O. Alhussein, “Rethinking strategic mechanism design in the age of large language models: New directions for communication systems,”IEEE Internet of Things Magazine, vol. 8, no. 6, pp. 50–57, 2025

    work page 2025

  46. [46]

    A vision, survey, and roadmap toward space communications in the 6G and beyond era,

    K. Ntontin, E. Lagunas, J. Querol, J. ur Rehman, J. Grotz, S. Chatzinotas, and B. Ottersten, “A vision, survey, and roadmap toward space communications in the 6G and beyond era,”Proceedings of the IEEE, vol. 113, no. 9, pp. 987–1023, 2025

    work page 2025

  47. [47]

    Dynamic pricing and scheduling in LEO satellite networks,

    X. Li, K. Mo, Z. Li, and H. Xu, “Dynamic pricing and scheduling in LEO satellite networks,”Computer Networks, vol. 262, Art. no. 111152, 2025. 32

    work page 2025