Systems & Networks · Computer Science & AI
Networking & Internet
The newest papers in Networking & Internet that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
248 papers, from 31 August 2026 to 5 November 2026: 208 arXiv preprints and 40 OpenAlex records.
Get the few papers worth your time in Networking & Internet every morning.
Follow Networking & Internet and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 13
Nonparametric Contextual Pricing and Inventory Learning under Censored Demand
In online retailing, when a product sells out, a retailer often sees only the units sold, not how many customers would have bought it had inventory been available.Reaching Fairness by Reallocating Goods
Fair allocation of indivisible goods has largely been studied under the assumption that no prior allocation exists.Constrained Fair Allocations via Partition Matroid Reductions
We study fair allocation of indivisible goods under additive valuations and matroid constraints.Residual Maximin Share: Exact Finite-Agent Frontier, Sparse Extremizers, and Threshold Cuts
Residual maximin share (RMMS) is the largest share threshold that remains guaranteeable throughout dynamic allocation processes, even after previously allocated, lower-valued bundles are removed…Fluid Antenna Multiple Access for Noise Modulation
Noise modulation (NoiseMod) encodes information in the variance of a noise-like waveform.Rival-Injective Allocations: Support-List Structure and Maximum-Anchor EFX$_0$ Certificates
We study complete allocations under nonnegative additive valuations through the positive supports of goods, focusing on the all-good form of envy-freeness up to any good (EFX$_0$).Dec-BFTRL: Squre-Root Regret for Decentralized Online Upper-Linearizable Optimization under Separation Access with Application to Continuous Submodular Maximization
We study decentralized online optimization of upper-linearizable payoffs over an action set under efficient separation access, with applications to online continuous diminishing-return (DR)…An Approach to Asynchronous Unsourced Random Access
In this work we propose an approach to construct a fully asynchronous unsourced random access communications (URA) system.