Sign inGet started
Paper · arXiv

Adversarial Water-Filling: Theory, Algorithms, and a Domain-Specific Wireless Foundation Model

Competitive resource allocation problems over frequency and space can be formulated as minimax interaction between transmit power and worst-case interference. This formulation naturally arises in multi-operator low Earth orbit (LEO) satellite spectrum sharing, where transmissions from competing constellations interfere in real-time. Under Gaussian channels, the corresponding power-allocation problem admits a convex-concave formulation with a unique saddle point. Discrete constellations yield generally nonconvex mercury/water-filling formulations. In this paper we propose the adversarial water-filling (AWF) problem with corresponding theory and algorithms for these settings. In addition, w...

AuthorsXindi Tong, Chee Wei Tan, H. Vincent Poor
Primary categorycs.IT
Published24 May 2026
Last updated at source17 September 2026
cs.ITcs.LGmath.OC
Embed this entry
<iframe src="https://silytics.si/embed/item/7cdf2d9f-0b80-47eb-bddb-807bcd923669" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.