Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 9 March
Let $\mathcal{T}$ denote a Galton–Watson tree with offspring distribution $\xi$ satisfying $\mathbb{E}(\xi) = 1$, and let $\mathcal{T}_n$ be the Galton–Watson tree conditioned to have exactly $n$ nodes. We show that, under a mild moment condition on $\xi$, the number of occurrences of a fixed rooted plane tree $\mathbf{t}$ as a general subtree in $\mathcal{T}_n$ is asymptotically normal as $n \to \infty$, with both mean and variance linear in $n$. In addition, we prove that this limiting distribution is nondegenerate except for some special cases where the variance remains bounded. These results confirm a conjecture of Janson in recent work on the same topic. Finally, we present examples showing that if the proposed moment condition on $\xi$ is violated, the conclusion may fail.
Analysis of PDEs
Chemotaxis with tomography
Cells encounter a diverse array of physical and chemical signals as they navigate their natural surroundings. However, their response to the simultaneous presence of multiple cues remains elusive. Particularly, the impact of topography alongside a chemotactic gradient on cell migratory behavior remains insufficiently explored. In this paper, we investigate the effects of topographical obstacles during chemotaxis. Our approach involves modifying the Keller-Segel model, incorporating a spatially dependent coefficient of chemotaxis. Through our analysis, we demonstrate that this coefficient plays a crucial role in preventing blow-up phenomena in cell concentration.
Read the full abstract
Number Theory
Serre conjecture II for pseudo-reductive groups
The Serre conjecture II predicts that every torsor under a semisimple, simply connected, algebraic group over a field of cohomological dimension at most 2 and of degree of imperfection at most 1 has a rational point. We generalize this conjecture to pseudo-reductive groups and prove their equivalence. In particular, we show that every torsor under a pseudo-semisimple, simply connected group over a global function field or a non-archimedean local field always has a rational point.
Read the full abstract
Combinatorics
Patrolling cop vs omniscient robber
We study a variant of the classical Cops and Robbers game with one cop and one robber. The cop follows a fixed walk on the graph, called a patrol, that is chosen before the game begins. The robber is omniscient and knows the entire patrol in advance. A capture occurs when the robber comes within a given distance of the cop, and this distance is referred to as the capture distance. The patrol capture radius, $\tilde{\rho}{(G)}$, is the minimum radius of capture required for the cop to always be able to capture the robber on a connected graph $G$, under optimal play. We initiate a systematic study of this parameter for several graph classes. We determine the exact value of $\tilde{\rho}{(G)}$ for trees, establish upper and lower bounds for grids, and analyze the parameter for various families of chordal graphs, including interval graphs and caterpillars. Along the way, we develop general tools and structural results that may be of independent interest for the study of pursuit-evasion games with predetermined patrols and limited information.
Read the full abstract
Information Theory
Coupling-Aware RHS Beamforming for Wideband Multi-User Sum Rate Maximization
Wideband multi-user transmission assisted by reconfigurable holographic surfaces (RHSs) is fundamentally limited by mutual coupling effect among densely packed sub-wavelength radiation elements. This paper develops a coupling-aware wideband RHS model and an efficient joint beamforming framework to maximize the multi-user sum rate under practical feeder power and RHS excitation power constraints. We establish an electromagnetic equivalent model based on magnetic-dipole elements and a physically interpretable coupling decomposition into free space near field coupling and guided surface wave coupling. For optimization, we employ a weighted minimum mean square error (WMMSE)-based block coordinate method with a closed-form digital precoder update and introduce a Jacobian-aided coupling consistent hologram update that preserves coupling sensitivity via a first-order surrogate while keeping the hologram subproblem convex and efficiently solvable by projected first-order methods. Meep experiments verify the correctness of the proposed coupling model, and the simulations for a 28~GHz, 1~GHz-bandwidth RHS downlink prove the effectiveness of Jacobian-aided WMMSE-based method.
Read the full abstract
Optimization and Control
Finite-Horizon Optimal Consumption and Investment with Time-Varying Job-Switching Costs
In this paper, we study the finite-horizon problem of an economic agent's optimal consumption, investment, and job-switching decisions. The key new feature of our model is that the job-switching cost is time-varying. This extension leads to a novel mathematical characterization: the agent's dual problem reduces to a parabolic double obstacle problem with time-dependent upper and lower obstacles. By employing rigorous PDE theory, we establish not only the existence and uniqueness of the solution to this double obstacle problem, but also the smoothness of the two free boundaries that emerge from it. Building on these results, we characterize the agent's optimal consumption, portfolio, and job-switching strategies.
Read the full abstract
Probability
Asymptotic Analysis of Discrete-Time Hawkes Process
In a discrete-time setting, we consider an arrival process $\left\{\xi_n \, \middle| \, n = 1, 2, \ldots \right\}$, which models the occurrence of events, and a corresponding point process $\left\{H_n \, \middle| \, n = 1, 2, \ldots \right\}$, known as the discrete-time Hawkes process. These two stochastic processes are related by $H_n = \sum_{i=1}^n \xi_i$, and exhibit a self-exciting property. In particular, we study the limiting behavior of the arrival process and establish the Large Deviation Principle for the discrete-time Hawkes process. We also illustrate an application in which insurance claims are modeled using the discrete-time Hawkes process and analyze its behavior.
Read the full abstract
Combinatorics
A generalization of Kadell's orthogonality ex-conjecture
In 2000, Kadell gave an orthogonality conjecture for a symmetric function generalization of the Zeilberger–Bressoud $q$-Dyson constant term identity. The non-zero part of Kadell's conjecture is a constant term identity indexed by a weak composition $v$. This conjecture was first proved by Károlyi, Lascoux and Warnaar in 2015. They further formulated a closed-form expression for the above constant term when all parts of the composition $v$ are distinct. In 2021, Zhou obtained a recursion for this constant term for an arbitrary composition $v$. In this paper, by categorizing the variables into two parts, we generalize Zhou's result.
Read the full abstract
Algebraic Topology
Higher operad structure for Fukaya categories
Operads often arise from geometry. The standard $A_\infty$ operad can be derived from the cellular chains on the Stasheff associahedra, and an $A_\infty$ algebra is an algebra over this operad. The notion of an $\mathbf{fc}$-multicategory, also called a virtual double category, is a two-dimensional generalization of operads and multicategories. Here $\mathbf{fc}$ stands for the free category monad. We establish a natural $\mathbf{fc}$-multicategory structure on the collection of moduli spaces of pseudo-holomorphic polygons with boundary on sequences of Lagrangian submanifolds in a symplectic manifold. These moduli spaces are known to underlie the construction of Fukaya categories. Based on this, we develop the theory of differential graded (dg) variants of $\mathbf{fc}$-multicategories and show that a broad range of $A_\infty$-type structures, such as $A_\infty$ algebras, $A_\infty$ (bi)modules, and $A_\infty$ categories (possibly curved), admit a uniform operadic formulation as algebras over dg $\mathbf{fc}$-multicategories.
Read the full abstract
Combinatorics
On Representing Matroids via Modular Independence
We study a matrix-based notion of matroid representation over local commutative rings obtained by replacing linear independence with modular independence. This construction always defines an independence system, though not necessarily a matroid. Under a mild nilpotent hypothesis, we show that chain rings are exactly the local rings for which the minimal number of generators is monotone on finitely generated submodules, and over commutative chain rings we obtain a criterion for the associated independence system to be a matroid. For codes over finite commutative chain rings, we identify puncturing with deletion, show that shortening agrees with contraction under a contractibility hypothesis, and establish duality for free codes. We further derive bounds for simple and uniform matroids, prove that the uniform matroid $U_{2, n}$ is representable if and only if the size $n$ is at most the sum of the cardinalities of the local ring and its unique maximal ideal, and show that all excluded minors for $\mathbb{F}_{4}$-representability are representable over $\mathbb{Z}/4\mathbb{Z}$. The examples also include ring representations of matroids not representable over any field, such as the Vámos matroid over $\mathbb{Z}/8\mathbb{Z}$.
Read the full abstract
Logic
Primitive recursive categoricity spectra of functional structures
For the notion of degree of categoricity, we study an analogous notion for punctual structures. We show that such notions coincide for non-$\Delta_{1}^{0}$-categorical injection structures, and construct an example of a $\Delta_{1}^{0}$-categorical injection structure for which these notions differ. Additionally, we also show that in every non-zero c.e.~Turing degree, there exists a PR-degree that is low for punctual isomorphism (to be defined), and also a PR-degree that is a degree of punctual categoricity.
Read the full abstract
Logic
Primitive recursive categoricity spectra
We study the primitive recursive analogue of computable categoricity spectra for various natural classes of structures. We show that these notions coincide for all relatively $\Delta_{2}^{0}$-categorical equivalence structures and linear orders, relatively $\Delta_{3}^{0}$-categorical Boolean algebras, and computably categorical tree as partial orders.
Read the full abstract
Statistics Theory
Post-Hoc Large-Sample Statistical Inference
We derive inferential procedures for large sample sizes that remain valid under data-dependent significance levels (so-called "post-hoc valid inference"). Classical statistical tools require that the significance level – the "type-I error" – is selected prior to seeing or analyzing any data. This restriction leads to some drawbacks. For instance, if an analyst generates an inconclusive confidence interval, repeating the process with a larger significance level is not an option – the result is final. Recently, e-values have emerged as the solution to this problem, being both necessary and sufficient tools for performing various forms of post-hoc inference. All such results, however, have thus far been nonasymptotic. As a result, they inherit familiar limitations of nonasymptotic inferential procedures such as requiring strong moment assumptions and being conservative in general. This paper develops a theory of post-hoc inference in the asymptotic setting, yielding asymptotic post-hoc confidence sets and asymptotic post-hoc p-values that make weaker assumptions and are sharper than their nonasymptotic counterparts.
Read the full abstract
Optimization and Control · Cross-listed from cs.RO
Drag-Aware Aerodynamic Manipulability for Torque-Limited Redundant Multirotors: Aerodynamic Promptness based on the Symmetric Acceleration Capacity
Aerodynamic promptness quantifies how rotor-speed variations generate multirotor wrench variations, but its Euclidean formulation assigns the same local cost to a given rotor acceleration at every operating speed. This work develops a capacity-aware extension for redundant multirotors with arbitrary numbers of heterogeneous rotors and wrench components. Under bounded motor torque and aerodynamic drag, each generally asymmetric instantaneous rotor-acceleration interval contains a largest zero-centered subset whose radius defines the symmetric acceleration capacity (SAC). The SAC induces a Riemannian metric on the positive-capacity rotor-speed region. Propagating its co-metric through the nonlinear rotor-speed-to-wrench differential yields a state-attached task-rate capability matrix and ellipsoid. The corresponding inverse quadratic form equals the minimum normalized rotor-acceleration effort required to realize a prescribed wrench rate, while the ellipsoid volume defines the drag-aware aerodynamic manipulability (DAAM) index. Fiberwise DAAM maximization provides a task-coordinate-invariant criterion for selecting task-equivalent actuator states; its maximizing set exists on compact regular domains and can be nonconvex and set valued. Low-dimensional two- and three-rotor studies make the resulting fiberwise geometry and parameter dependence directly visible. A complementary two-rotor use case shows how DAAM can inform a continuous allocation section subject to directional motor-torque feasibility. For two heterogeneous propulsion systems, the resulting sections reduce saturation-induced force-tracking degradation relative to the pseudoinverse in the faster command bands
Read the full abstract
Information Theory
Entropies, cross-entropies and Rényi divergence: sharp three-term inequalities for probability density functions
A new sharp inequality featuring the differential Rényi entropy, the Rényi divergence and the Rényi cross-entropy of a pair of probability density functions is established. The equality is reached when one of the probability density function is an escort density of the other. This inequality is applied, together with a general framework of a pair of transformations reciprocal to each other, to derive a number of further inequalities involving both classical and new informational functionals. A remarkable fact is that, in all these inequalities, the Rényi divergence of two probability density functions is sharply bounded by quotients of informational functionals of cross-type and single type. More precisely, we derive sharp inequalities composed by relative and cross versions of the absolute moments, or of the Fisher information measures (among others), and involving two and three probability density functions.
Read the full abstract
Probability
Parameter Estimation for Complex {\alpha}-Fractional Brownian Bridge
We study the statistical inference problem for a complex $\alpha$-fractional Brownian bridge process $Z$ defined by the stochastic differential equation \[ \mathrm{d}Z_t = -\alpha \frac{Z_t}{T - t} \mathrm{d}t + \mathrm{d}\zeta_t, \quad t \in [0, T), \] with initial condition $Z_0 = 0$, where $\alpha = \lambda - \sqrt{-1}w$, $\lambda > 0$, $w \in \mathbb{R}$ and $\zeta_t$ is a complex fractional Brownian motion. We establish the well-posedness of the fractional Brownian bridge $Z_t$ over the time interval $[0, T]$ for all $H \in (0, 1)$, and prove the strong consistency and the asymptotic distribution for the classic least squares estimator of the parameter \(\alpha\) when \(H \in \left(\frac{1}{2}, 1\right)\). The proofs are based on stochastic analysis elements about complex multiple Wiener-Itô integrals and the complex Malliavin calculus. Unlike the real-valued fractional Brownian bridge considered in the literature, the two-dimensional limiting distribution has non-Cauchy marginal distributions.
Read the full abstract
Combinatorics
The exact Erdős-Ko-Rado Theorem for 3-wise $t$-intersecting uniform families
One of the central problems in extremal set theory is the determination of the maximum size of an $r$-wise $t$-intersecting $k$-graph on $n$ vertices. For $r=2$ after decades of effort, a complete solution was given by the Complete Intersection Theorem (\cite{AK0}). However the case $r\geq 3$ remains wide open. The $t$-star consisting of all $k$-sets containing a fixed $t$-set provides a lower bound. For $r=3$ and $k\geq t+2\geq44$, we determine the exact threshold for which it is optimal for $n>k$. The condition is essentially $n\geq \sqrt{t}k$. For $k\geq t+2\geq47$ and $n\geq\frac{\sqrt{4t+9}-1}{2}k$, we also establish the corresponding Hilton-Milner-type stability result.
Read the full abstract
Representation Theory
Vector-Valued Invariants Associated with All Irreducible Representations for a Finite Group
We investigate the complex reflection group $\mathfrak{G}$ associated with the octahedral group, identified as the ninth entry in the Shephard-Todd classification. We determine all irreducible representations of $\mathfrak{G}$ and compute the character table. Moreover, for each representation, we compute the module of vector-valued invariants and relate it to the fundamental invariants of the octahedral group. Additionally, we derive explicit dimension formulas for the corresponding rings of invariants.
Read the full abstract
Statistics Theory
Estimation of the entropy of normal populations under prior information
In many practical applications, prior knowledge about unknown parameters is available in the form of ordering constraints, and incorporating such information into the inferential procedure can improve the efficiency of the resulting estimators. In this paper, we consider the problem of estimating Shannon's entropy of two normal populations with ordered location parameters under a general location-invariant loss function. We derive the maximum likelihood estimator, the restricted maximum likelihood estimator, and the uniformly minimum variance unbiased estimator. Furthermore, we obtain an estimator that dominates the best affine equivariant estimator. In addition, we propose a smooth estimator that improves upon the best affine equivariant estimator. Moreover, we obtain improved estimators with respect to the Pitman closeness criterion. We consider interval estimation and construct several confidence intervals, such as asymptotic confidence intervals, bootstrap confidence intervals, highest posterior density credible intervals, and the intervals based on generalized pivotal quantities. A Monte Carlo simulation study is conducted to assess the performance of the proposed point and interval estimators. Finally, the proposed methods are illustrated by using two real data sets.
Read the full abstract
Geometric Topology
RL unknotter, hard unknots and unknotting number
We train a reinforcement learning agent to simplify hard unknot diagrams and pair it with a learned crossing selector to search for short unknotting sequences. Three examples found by the agent lead to an infinite family of prime two-bridge knots of unknotting number three whose connected sums with the figure-eight knot also have unknotting number three, and fifteen new unknotting upper bounds were found on the set of prime knots up to 13 crossings.
Read the full abstract
Commutative Algebra
Contravariantly infinite resolving subcategories
Let $R$ be a commutative Noetherian ring. Denote by $\textrm{mod}R$ the category of finitely generated $R$-modules. In this paper, a contravariantly infinite subcategory of $\textrm{mod}R$ is defined as a full subcategory $\mathscr{X}$ of $\textrm{mod}R$ such that no module outside $\mathscr{X}$ admits a right $\mathscr{X}$-approximation. This paper provides several criteria for contravariant infiniteness in the case where $R$ is a local complete intersection.
Read the full abstract
Mathematical Physics · Cross-listed from hep-th
Probing Lorentz symmetry violation via the Casimir effect in rectangular cavities
We investigate the Casimir effect as a probe of Lorentz symmetry violation for a real scalar field confined to a rectangular waveguide with Dirichlet boundary conditions. The field dynamics is governed by a Lorentz-violating extension of the Klein-Gordon theory involving a fixed background four-vector $u_\mu$. Focusing on four representative configurations in which the background is aligned with the temporal direction or with one of the spatial axes of the cavity, we derive the modified mode spectra and the corresponding vacuum energies. We show that these configurations induce anisotropic modifications of the dispersion relations that depend explicitly on the orientation of the background vector relative to the cavity geometry, while still preserving mode separability. The resulting Casimir energy acquires characteristic direction-dependent corrections that encode the breaking of Lorentz symmetry, without altering the universal functional structure of the spectral kernel. Our analysis provides a controlled and transparent framework for isolating Lorentz-violating effects in confined geometries and highlights Casimir systems as sensitive probes of anisotropic physics and fundamental spacetime symmetries.
Read the full abstract
Classical Analysis and ODEs
A note on small cap square function and decoupling estimates for the parabola
In this paper, we prove small cap square function and decoupling estimates for the parabola, where the small caps are essentially axis-parallel rectangles of dimensions $\delta\times \delta^\beta$ for $0\leq \beta\leq 1$. Our estimates complement the known results for $1 \leq \beta \leq 2$ and are sharp up to polylogarithmic factors.
Read the full abstract
Information Theory
Hard/Soft NLoS Detection via Combinatorial Data Augmentation for 6G Positioning
A key enabler for meeting the stringent requirements of 6G positioning is the ability to exploit site-dependent information governing line-of-sight (LoS) and non-line-of-sight (NLoS) propagation. However, acquiring such environmental information in real time is challenging in practice. To address this issue, we propose a novel NLoS detection algorithm termed combinatorial data augmentation-guided NLoS detection (CDA-ND), which builds upon our prior work. CDA-ND generates numerous preliminary estimated locations (PELs) by applying multilateration over many gNodeB (gNB) combinations using a single snapshot of range measurements. When a target gNB is in NLoS, the resulting PELs split into two clusters: one derived using the target gNB's range measurement and the other derived without it. Their displacement is summarized by a single vector, called the NLoS evidence vector (NEV), which is used to compute an NLoS likelihood score. Based on this score, two modes of NLoS detection are developed. First, each gNB is classified as LoS or NLoS, termed hard decision (HD), using a simple threshold test. Second, each gNB's NLoS confidence is probabilistically quantified, termed soft decision (SD), which extends HD with weak site-survey priors, namely empirical NLoS-score samples and the average NLoS probability. We then design positioning algorithms tailored to these two modes by excluding gNBs deemed NLoS and re-weighting the remaining gNBs for SD. The proposed CDA-ND achieves high reliability in indoor factory environments under frequency range 1, attaining NLoS detection accuracies of 96.8% and 91.5% when the proportion of NLoS gNBs is approximately 18% and 56%, respectively. As a result, integrating CDA-ND into positioning significantly reduces mean absolute error by about 22% and 67% in LoS- and NLoS-dominant environments, respectively.
Read the full abstract
Analysis of PDEs
Curve Lengthening Bifurcations in Modally Filtered Nonlinear Schrödinger Systems
Extensions of the parametric nonlinear Schrödinger equations (PNLS) for phase-sensitive optical resonance are developed that preserve the curve lengthening bifurcation seen in the original system. This bifurcation occurs in sharp interface reductions when the motion of the interface transitions from curvature-driven flow (curve shortening) to motion against curvature regularized by higher order Willmore effects (curve lengthening). We construct a specific class of down-phase self-interaction operators via a spectral transform of the down-up operator. While in the bifurcation regime, the corresponding modally filtered nonlinear Schrödinger systems preserve the linear stability of the front, admit the sign flip in the linear term in the normal velocity while preserving the proper sign of the Willmore terms.
Read the full abstract
Numerical Analysis
A Structure-Preserving LOBPCG Algorithm for the Bethe-Salpeter Eigenvalue Problem
The Bethe-Salpeter eigenvalue problem is a structured eigenvalue problem arising in many-body physics. In practice, a few of the smallest positive eigenvalues and the corresponding eigenvectors need to be computed. In principle, the LOBPCG algorithm can be applied to solve this eigenvalue problem. However, direct application of the existing LOBPCG algorithm does not utilize the inherent structure of the problem. We design a structure-preserving eigensolver based on the indefinite LOBPCG algorithm to efficiently solve the Bethe-Salpeter eigenvalue problem. We propose an improved Hetmaniuk-Lehoucq trick for the indefinite inner product, as well as an adaptive, multi-level orthogonalization strategy to ensure the numerical stability of our algorithm. Numerical experiments demonstrate that the proposed algorithm can efficiently and accurately compute the desired eigenpairs. Since the symplectic eigenvalue problem for symmetric positive definite matrices can be transformed to the Bethe-Salpeter eigenvalue problem, our algorithm can naturally be adopted as a symplectic eigensolver.
Read the full abstract
Symplectic Geometry
Closed Reeb orbits on contact type hypersurfaces in $T^*S^n$
In this paper, it is proved that under dynamically convex condition, there exist at least $[\frac{n+1}{2}]$ closed Reeb orbits on a closed contact type hypersurface in $T^*S^n$ enclosing the zero section and bounding a simply connected Liouville domain. Furthermore, if the contact form is non-degenerate and has finitely many closed Reeb orbits, then there exist at least two irrationally elliptic closed Reeb orbits.
Read the full abstract
Statistics Theory · Cross-listed from cs.LG
Reject, Resample, Repeat: Understanding Parallel Reasoning in Language Model Inference
Inference-time methods that aggregate and prune multiple samples have emerged as a powerful paradigm for steering large language models, yet we lack any principled understanding of their accuracy-cost tradeoffs. In this paper, we introduce a route to rigorously study such approaches using the lens of *particle filtering* algorithms such as Sequential Monte Carlo (SMC). Given a base language model and a *process reward model* estimating expected terminal rewards, we ask: *how accurately can we sample from a target distribution given some number of process reward evaluations?* Theoretically, we identify (1) simple criteria enabling non-asymptotic guarantees for SMC; (2) algorithmic improvements to SMC; and (3) a fundamental limit faced by all particle filtering methods. Empirically, we demonstrate that our theoretical criteria effectively govern the *sampling error* of SMC, though not necessarily its final *accuracy*, suggesting that theoretical perspectives beyond sampling may be necessary.
Read the full abstract
Numerical Analysis
LegONet: Plug-and-Play Structure-Preserving Neural Operator Blocks for Compositional PDE Learning
Learned PDE solvers are often trained as monolithic surrogates for a specific equation, boundary condition and discretization. This makes them difficult to reuse when mechanisms change and it can limit stability under long-horizon rollout. We introduce Lego-like Operator Network (LegONet), a compositional framework that builds PDE solvers from plug-and-play, structure-preserving operator blocks defined on shared boundary-adapted spectral representations. LegONet separates boundary handling from mechanism learning, satisfying boundary conditions by construction. It also separates mechanism learning from time integration, enabling pretrained blocks to be assembled into new solvers without retraining. We also derive a finite-horizon error decomposition that separates block mismatch from splitting error and provides mechanism-level diagnostics for long-horizon predictions. Across ten time-dependent PDEs, LegONet delivers accurate closed-loop rollouts with improved stability under cross-PDE recombination and boundary reconfiguration. More broadly, this modular formulation suggests a path from task-specific neural solvers towards plug-and-play operator libraries for scientific computing.
Read the full abstract
Optimization and Control
A Distributed Method for Cooperative Transaction Cost Mitigation
Funds at large portfolio management firms may consist of many portfolio managers (PMs), each managing a portion of the fund and optimizing a distinct objective. Although the PMs determine their trades independently, the trade lists may be netted and executed by the firm. These net trades may be sufficiently large to impact the market prices, so the PMs may realize prices on their trades that are different from the observed midpoint price of the assets before execution. These transaction costs generally reduce the returns of a portfolio over time. We propose a simple protocol, based on methods from distributed convex optimization, by which a firm can communicate estimated transaction costs to its PMs, and the PMs can potentially revise their trades to realize reduced transaction costs. This protocol does not require the PMs to disclose their method of determining trades to the firm or to each other, nor does it require the PMs to communicate their trade lists with each other. As the number of adjustment rounds grows, the trades converge to the ones that are optimal for the firm. As a practical matter we observe that even just a few rounds of adjustment lead to substantial savings for the firm and the PMs.