pith. machine review for the scientific record. sign in

arxiv: 2604.26902 · v2 · submitted 2026-04-29 · 💰 econ.TH

Recognition: unknown

Many-to-many stable matching in large economies

Karolina Vocke, Michael Greinecker

Pith reviewed 2026-05-07 11:58 UTC · model grok-4.3

classification 💰 econ.TH
keywords many-to-many matchingstable matchingslarge economiesdistributional outcomestree stabilitypairwise stabilityPolish spacesnetworked markets
0
0 comments X

The pith

Existence proofs for stable many-to-many matchings transfer mechanically from finite to large economies with insignificant agents.

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

The authors give a direct method to carry over existence of stable outcomes from ordinary finite matching models to large markets where each participant has negligible individual effect. Markets are many-to-many and networked, with outcomes expressed as joint distributions over agent characteristics and chosen contracts; characteristics may belong to any Polish space. The transfer applies to several stability concepts, and the paper uses it to prove that tree-stable and pairwise-stable outcomes exist. A reader cares because many real assignment problems involve thousands of participants who each count for little, yet the absence of stability can cause markets to break down.

Core claim

The paper shows that for networked many-to-many matching markets with individually insignificant agents, outcomes formulated as joint distributions over characteristics in Polish spaces and contract choices allow a mechanical transfer of existence results from finite models to the large-economy setting. In particular, this establishes the existence of tree-stable and pairwise-stable outcomes.

What carries the argument

The mechanical transfer method that lifts finite-model existence results to distributional outcomes in large markets for many stability notions.

If this is right

  • Tree-stable outcomes exist in large many-to-many networked markets.
  • Pairwise-stable outcomes exist under the same large-economy conditions.
  • The transfer applies to multiple stability notions beyond the two highlighted.
  • Stability existence is preserved when outcomes are expressed as joint distributions rather than assignments.

Where Pith is reading between the lines

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

  • Large-scale platforms or assignment systems could test candidate stable configurations on finite subsamples before scaling.
  • The same transfer technique may shorten proofs for other continuum-agent models once their finite versions are known.
  • Markets with agents who retain measurable individual weight would still need separate arguments.

Load-bearing premise

Agents are individually insignificant and outcomes can be written as distributions over Polish spaces.

What would settle it

A concrete large economy with insignificant agents whose Polish-space characteristics admit no tree-stable or pairwise-stable distributional outcome, even though every finite approximation does.

read the original abstract

We study stability notions for networked many-to-many matching markets with individually insignificant agents in distributional form. Outcomes are formulated as joint distributions over characteristics of agents and contract choices. Characteristics can lie in an arbitrary Polish space. We provide a mechanical method for transferring existence results for finite matching models to large matching models for many stability notions. In particular, we show that tree-stable and pairwise-stable outcomes exist.

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 studies stability notions for networked many-to-many matching markets with individually insignificant agents, formulating outcomes as joint distributions over agent characteristics and contract choices where characteristics lie in an arbitrary Polish space. It provides a mechanical method for transferring existence results from finite matching models to these large distributional economies and, in particular, establishes existence of tree-stable and pairwise-stable outcomes.

Significance. If the transfer method is rigorously shown to preserve stability, the result would be useful for extending finite-model existence theorems to continuum economies in a general way, without requiring new ad-hoc constructions for each stability notion. The distributional formulation over Polish spaces and the emphasis on a mechanical transfer are strengths that could facilitate reuse of prior literature on finite many-to-many markets.

major comments (1)
  1. [Main transfer theorem / existence proof] The central transfer claim (abstract) requires that the stability correspondence be closed under weak convergence of measures. The manuscript must verify upper hemicontinuity of the set of stable contract distributions (or equivalent compactness/continuity conditions on preferences and the contract space) to ensure that a weak limit of finite-model stable outcomes remains stable; without this, a blocking contract can appear only in the limit distribution, undermining the lift for tree-stable and pairwise-stable notions in many-to-many networks.
minor comments (2)
  1. [Introduction] Clarify in the introduction or main theorem statement whether the mechanical transfer applies verbatim to all stability notions mentioned or only to tree-stable and pairwise-stable; the abstract is slightly ambiguous on scope.
  2. [Model setup] The Polish-space setting is stated as arbitrary, but the proof should explicitly list any measurability or tightness conditions imposed on the characteristic space to guarantee the existence of the limiting measure.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and constructive feedback on our manuscript. The primary concern regarding the need to verify closure of the stability correspondence under weak convergence is well-taken, and we address it directly below. We will revise the paper to incorporate an explicit argument establishing the required upper hemicontinuity for the stability notions considered.

read point-by-point responses
  1. Referee: The central transfer claim (abstract) requires that the stability correspondence be closed under weak convergence of measures. The manuscript must verify upper hemicontinuity of the set of stable contract distributions (or equivalent compactness/continuity conditions on preferences and the contract space) to ensure that a weak limit of finite-model stable outcomes remains stable; without this, a blocking contract can appear only in the limit distribution, undermining the lift for tree-stable and pairwise-stable notions in many-to-many networks.

    Authors: We agree that an explicit verification of upper hemicontinuity (or equivalent conditions ensuring the stability set is closed under weak convergence) is necessary to rigorously justify the mechanical transfer of existence results. The current draft relies on the Polish space setting and standard continuity assumptions on preferences to ensure that potential blocking contracts in the limit can be approximated by blocks in the finite economies, but we acknowledge that this step should be stated as a separate lemma for clarity. In the revision, we will add a proposition establishing that the correspondence of tree-stable and pairwise-stable contract distributions is upper hemicontinuous with respect to weak convergence of measures. The argument will use the fact that blocking involves only finite coalitions, combined with continuity of the contract space and agent characteristics, to show that any blocking opportunity in a weak limit can be lifted to nearby finite approximations. This preserves stability in the limit without requiring new ad-hoc constructions. We view this as a strengthening rather than a change to the main results. revision: yes

Circularity Check

0 steps flagged

No circularity: mechanical transfer from external finite-model existence results

full rationale

The paper's core contribution is a general mechanical method to lift existence theorems for stability notions (tree-stable, pairwise-stable) from finite many-to-many matching models to distributional large economies with Polish characteristics. This is presented as a transfer argument relying on prior finite-model literature rather than any self-referential definition, fitted parameter renamed as prediction, or ansatz smuggled via self-citation. No equations or steps in the provided abstract or description reduce the claimed existence result to its own inputs by construction. The derivation remains self-contained against external benchmarks, with the transfer method itself constituting independent mathematical content.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Based on the abstract alone, the claim rests on standard measure-theoretic properties of Polish spaces and the existence of stable outcomes in finite many-to-many models; no free parameters, invented entities, or ad-hoc axioms are visible.

axioms (2)
  • standard math Polish spaces admit the necessary measurability and topological properties for distributional outcomes
    Invoked when stating that characteristics lie in an arbitrary Polish space.
  • domain assumption Finite many-to-many matching models possess tree-stable and pairwise-stable outcomes for the relevant stability notions
    The transfer method presupposes these finite results as given inputs.

pith-pipeline@v0.9.0 · 5344 in / 1334 out tokens · 40019 ms · 2026-05-07T11:58:03.054955+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

14 extracted references

  1. [1]

    Aliprantis, C. D. and K. C. Border (2006).Infinite dimensional analysis(Third ed.). Springer, Berlin. 6Use the continuity of the quotient mapping fromn-tuples ton-multisets, with Aliprantis and Border (2006, Theorem 17.23, Theorem 17.27, and Theorem 17.28). 13

  2. [2]

    Azevedo, E. M. and J. W. Hatfield (2018). Existence of equilibrium in large matching markets with complementarities. Working paper

  3. [3]

    (1999).Convergence of probability measures(Second ed.)

    Billingsley, P. (1999).Convergence of probability measures(Second ed.). Wiley Series in Prob- ability and Statistics: Probability and Statistics. New York: John Wiley & Sons Inc. A Wiley-Interscience Publication

  4. [4]

    Carmona, G. and K. Laohakunakorn (2023). Existence of stable matchings in large economies with externalities. Working paper

  5. [5]

    Carmona, G. and K. Laohakunakorn (2024). Stable matching in large markets with occupational choice.Theoretical Economics 19(3), 1261–1304

  6. [6]

    Kim, and F

    Che, Y.-K., J. Kim, and F. Kojima (2019). Stable matching in large economies.Economet- rica 87(1), 65–110

  7. [7]

    Chiappori, P.-A., R. J. McCann, and L. P. Nesheim (2010). Hedonic price equilibria, stable matching, and optimal transport: equivalence, topology, and uniqueness.Economic The- ory 42, 317–354

  8. [8]

    Gale, D. and L. S. Shapley (1962). College admissions and the stability of marriage.American Mathematical Monthly 69(1), 9–15

  9. [9]

    Gretsky, N. E., J. M. Ostroy, and W. R. Zame (1992). The nonatomic assignment model. Economic Theory 2, 103–127

  10. [10]

    Jagadeesan, R. and K. Vocke (2024). Stability in large markets.The Review of Economic Studies 91(6), 3532–3568

  11. [11]

    Klaus, B. and M. Walzl (2009). Stable many-to-many matchings with contracts.Journal of Mathematical Economics 45(7), 422–434

  12. [12]

    Kojima, F., P. A. Pathak, and A. E. Roth (2013). Matching with couples: Stability and incentives in large markets.Quarterly Journal of Economics 128(4), 1585–1632. N¨ oldeke, G. and L. Samuelson (2018). The implementation duality.Econometrica 86, 1283–1324

  13. [13]

    Ostrovsky, M. (2008). Stability in supply chain networks.American Economic Review 98(3), 897–923

  14. [14]

    Vocke, K. (2025). Anonymity and stability. Working paper. 14