Pith. sign in

REVIEW 2 major objections 4 minor 27 references

Optimal Risk-Sharing Rules in Network-based Decentralized Insurance

T0 review · 2 major / 4 minor · reviewed 2026-08-03 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper proves that on any connected friendship network, the optimal signed linear actuarially fair risk-sharing rule is unique and given by an explicit closed-form matrix; with equal shares among friends, the rule reduces to a graph-Lap

desk verdict Solid KKT-based generalization of complete-graph risk-sharing to general networks; Theorem 2.1 needs a wording fix on uniqueness of Γ, but the central results hold. read the letter →

arxiv 2602.05155 v3 pith:IG4YRTNG submitted 2026-02-05 math.OC math.PRq-fin.RM

Heather N. Fogarty , Sooie-Hoe Loke , Nicholas F. Marshall , Enrique A. Thomann This is my paper · ORCID
classification math.OCmath.PRq-fin.RM MSC 91B3090C2005C50
keywords decentralizedinsurancepeer-to-peerrisk-sharingnetworkgraphLaplacianvarianceminimizationactuariallyfairsignedlinear
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper studies how a group of agents connected by a friendship network should share their losses when only directly connected agents may exchange risk. It shows that among all linear, actuarially fair risk-sharing rules, there is exactly one that minimizes the sum of post-sharing variances, and it gives a closed-form expression for that rule in terms of the loss means, covariance, and network structure. When friends are required to take equal shares, the optimal rule takes the especially simple form A = I - c L M^{-1}, where L is the graph Laplacian. A sympathetic reader would care because this turns network-based insurance design into a tractable optimization problem and unifies earlier work that only covered fully connected networks.

What carries the argument

The load-bearing object is the linear risk-sharing rule H(X) = AX. The 'only friends share risk' constraint is encoded by requiring A to vanish outside the graph's adjacency-plus-diagonal support. The proof vectorizes A and rewrites the problem as a strictly convex quadratic program with equality constraints, so the KKT conditions are necessary and sufficient; the Lagrange multipliers reduce to a matrix Γ supported on non-edges, and Γ is the only quantity that must be computed by solving a linear system. In the equal-share case, the constraint forces A = I - L S, and connectedness plus Aµ = µ forces S = c M^{-1}, leaving a single scalar c that is found by minimizing a convex quadratic in c.

What would settle it

Take a small connected graph (e.g., four agents with one missing edge), pick a positive-definite Σ and positive µ, solve the quadratic program (4) with a generic convex QP solver, and compare every entry of the numerical minimizer with the formula from Theorem 2.1; any mismatch—or any violation of the KKT system (6)—would refute the characterization.

Watch

Extended reading notes

Core claim

For a connected graph G with n agents, losses X with mean µ and positive definite covariance Σ, Theorem 2.1 characterizes the unique solution A* of the quadratic program that minimizes (1/2)tr(AΣA^T) subject to full allocation (1^T A = 1^T), actuarial fairness (Aµ = µ), and the support constraint a_ij ≠ 0 only when i = j or {i,j} is an edge. The solution is A* = (1/n)11^T + (I - (1/n)11^T)[(1/a)µµ^T + Γ((1/a)Σ^{-1}µµ^T - I)]Σ^{-1}, where a = µ^T Σ^{-1} µ and Γ has zero diagonal and zero entries on edges, with its off-edge entries fixed by a linear system. Theorem 2.2 then shows that if friends must take equal shares of each agent's risk, the unique optimum becomes A = I - ĉ L M^{-1}, with ĉ

Load-bearing premise

The theorems assume the risk-sharing matrix may contain negative entries, meaning some agents can profit from others' losses; if that is forbidden, the optimization problem changes and the stated formulas no longer describe its optimum.

Editorial extensions

If this is right

  • The earlier complete-graph solution (all agents may share risk) is recovered exactly when Γ = 0, so the network result is a strict generalization.
  • Imposing a network structure weakly increases the minimized total variance: sharing with fewer counterparties cannot improve the optimum, as the examples show.
  • In the equal-share setting, the entire rule is determined by graph degrees, entrywise means, and covariances; for a d-regular graph with i.i.d. losses it becomes A = I - L/(d+1), where each agent keeps 1/(d+1) of its own loss and gives 1/(d+1) to each friend.
  • The nonnegativity conditions provide simple checks for when the signed optimum happens to involve no negative transfers, and the barbell example shows that choosing whom to connect can remove negative entries.
  • These results give a quantitative basis for comparing network designs by their post-sharing variance and for deciding whether equal sharing among friends is worth its cost.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because the paper explicitly allows signed transfers, its closed forms do not solve the version of the problem in which A must be entrywise nonnegative; a natural follow-up is to characterize the optimum under that stricter, more insurance-realistic constraint, where the feasible set is no longer an affine subspace and the KKT system changes.
  • The graph-Laplacian formula suggests that the variance reduction achievable by equal-share sharing is tied to the Laplacian's spectrum; one could test whether networks with larger algebraic connectivity systematically admit lower post-sharing variance under Theorem 2.2.
  • The barbell example implicitly proposes a network-design heuristic—connect agents whose mean losses lie within a bounded ratio—and a quantitative extension would derive the optimal such ratio from µ and Σ rather than choosing it by hand.
  • The single-period model could be iterated: applying the same optimal rule each period yields a multi-period scheme whose long-run variance could be compared with the multi-period P2P models cited in the introduction.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The paper studies optimal linear risk-sharing on an undirected graph, where each agent's post-sharing loss may depend only on their own loss and the losses of their neighbors. Agents minimize half the total variance of post-sharing losses subject to full allocation, actuarial fairness, and network constraints. Theorem 2.1 gives a closed-form characterization of the unique solution A* via a matrix Γ that solves the linear system (6). Theorem 2.2 specializes to the case where each agent's risk is split equally among friends and derives a Laplacian-based formula. Section 2.5 states nonnegativity conditions, and the paper provides several worked examples, including a barbell network.

Significance. If the main results hold, the paper extends the complete-graph result of Feng, Liu, and Taylor to arbitrary connected networks, and the graph-Laplacian connection for equal-sharing rules is a useful structural insight. The proofs are self-contained and use standard convex-optimization arguments; no parameters are fitted and the examples reproduce the stated objective values. The signed risk-sharing assumption is explicitly stated and is a modeling choice rather than a technical flaw. However, the statement of Theorem 2.1 overclaims uniqueness of the auxiliary matrix Γ, and Corollary 2.2 is misstated as written. These are fixable, but they are substantive enough to require revision.

major comments (2)
  1. [Theorem 2.1, Eq. (6)] The statement that Γ is 'determined by' the linear system (6) is not correct for graphs that are not connected. For the 3-vertex graph with edge set {{1,2}}, μ=1, Σ=I, the system (6) is singular: both γ13=γ23=0, γ31=γ32=3/2 and γ13=γ23=1, γ31=γ32=1/2 solve it, and both give the same A* in (5). The proof in §3 constructs a Lagrange-multiplier matrix Γ but never proves the coefficient matrix of (6) is nonsingular. Since the paper's stated scope is connected networks, Theorem 2.1 should either explicitly assume G is connected and prove uniqueness of Γ there, or reformulate (6) as 'let Γ be any solution' and note that all solutions yield the same A*. The uniqueness of A* is not affected, as it follows from strict convexity.
  2. [Corollary 2.2] The statement is false as written: 'the constant ĉ is nonnegative if and only if ĉ ≤ μ_i for i={1,2} and Cov(...)≤...' is an ill-posed biconditional, since a nonnegative ĉ can exceed μ_i. The correct statement should combine Lemma 2.2 and Corollary 2.1: for a 2-agent network, Â has all nonnegative entries iff 0 ≤ ĉ ≤ μ_i (i=1,2) and the covariance inequality holds. As printed, it is a mathematical error in a stated result and is used in §2.6.4, so it needs correction.
minor comments (4)
  1. [Section 1.1] The introduction refers to 'Proposition 2.2' for nonnegativity of Laplacian-based rules, but no Proposition 2.2 appears in Section 2.5; the relevant results are Lemma 2.2 and Corollaries 2.1–2.2. Please relabel or correct the reference.
  2. [Proposition 2.1 proof] The proof is headed 'Proof of Lemma 2.1' and contains several occurrences of μ^TΣμ in the denominator where the statement requires μ^TΣ^{-1}μ. The final condition is correct, but the proof should be cleaned up.
  3. [Section 2.6.1] The displayed numerical check of Lemma 2.1 appears to be inconsistent: with the printed μ and μ_* the stated product ∥μ−μ_*∥1∥μ∥∞=18 does not match the displayed vector. Please verify the arithmetic.
  4. [Section 3.2, KKT system] The equality constraints in (18) are always linearly dependent: the sum of the n equations Aμ=μ equals the μ-weighted sum of the n equations 1^T A=1^T. Thus the Lagrange multiplier ν* is not unique. This does not affect the derivation, since x* is unique and any ν* works, but the proof should acknowledge the non-uniqueness to avoid implying that (18) has a unique solution.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the paper solves an explicitly stated convex optimization problem with no fitted inputs, no self-citations, and no predictions that reduce to their own assumptions.

full rationale

The paper is self-contained. It poses explicit optimization problems (4) and (8) with constraints fully stated in terms of the model inputs (μ, Σ, and the graph). Theorem 2.1 is proved by rewriting the problem as an equality-constrained quadratic program and then applying KKT conditions; the formula for A* is derived from stationarity and feasibility, not assumed. Γ is introduced as a Lagrange-multiplier block and is solved from the constraint equations; even if the linear system for Γ may be singular in some disconnected cases, the allocation A* itself is unique by strict convexity, so this is a precision defect, not circularity. Theorem 2.2 similarly derives the parametrization A = I − cLM^{-1} from the constraints and then optimizes the scalar c via the first-order condition; ĉ is an algebraic formula, not a fitted parameter. The paper contains no self-citations by the authors: references [22], [9], [12], and others are external prior work used for comparison or standard facts. The examples are illustrative computations, not empirical predictions, and no quantity is fitted to data and then renamed as a prediction. Thus there is no circular step in the derivation chain.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No fitted constants or invented entities; the model inputs μ, Σ, G are given. All claims reduce to solving a convex quadratic program.

assumptions (5)
  • domain assumption The loss vector X has positive definite covariance matrix Σ.
    Assumed throughout; ensures Q = Σ⊗I is positive definite so the QP is strictly convex and the solution unique (Section 1.2, Step 3.2).
  • domain assumption The graph G is connected (and n ≥ 2).
    Used in Theorem 2.2 to assert the Laplacian nullspace is span{1}; the paper notes the disconnected case can be handled componentwise.
  • domain assumption Losses are nonnegative with positive variance, implying μ_i > 0.
    Needed for M = diag(μ) to be invertible in Theorem 2.2 and for Lemma 2.2's sign analysis.
  • standard math KKT conditions are necessary and sufficient for the convex QP.
    Cited to Boyd & Vandenberghe [9, Ch. 5]; used in Step 3.2 to justify solving the KKT system.
  • domain assumption The optimal risk-sharing rule is restricted to be linear.
    The paper studies H(X)=AX; global optimality among all rules is not addressed, though [27] is cited for the unrestricted case.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Optimal Risk-Sharing Rules in Network-based Decentralized Insurance." pith.science (2026). https://pith.science/paper/IG4YRTNG

@misc{pith2026260205155,
  author       = {Pith},
  title        = {Pith review of: Optimal Risk-Sharing Rules in Network-based Decentralized Insurance},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IG4YRTNG}},
  note         = {Machine review of arXiv:2602.05155}
}
read the original abstract

This paper studies decentralized risk-sharing on networks. In particular, we consider a model where agents are nodes in a given network structure. Agents directly connected by edges in the network are referred to as friends. We study actuarially fair risk-sharing under the assumption that only friends can share risk, and we characterize the optimal signed linear risk-sharing rule in this network setting. Subsequently, we consider a special case of this model where all the friends of an agent take on an equal share of the agent's risk, and establish a connection to the graph Laplacian. Our results are illustrated with several examples.

Figures

Figures reproduced from arXiv: 2602.05155 by the authors.

Figure 1
Figure 1. Many works on P2P insurance either perform non-olet risk pooling (represented by the star graph) or unrestricted risk-sharing (rep￾resented by the complete graph). In this work, we consider networks with general structures such as the Barbell graph. While a substantial body of work on P2P insurance has emerged, particularly over the past decade, the theoretical foundations of P2P risk-sharing on networks re￾main und… view at source ↗
Figure 2
Figure 2. A heat map visualization of the optimal A∗ for a fully￾connected network (left), and A∗ for the barbell network (right). Observe that negative entries arise in the matrix locations corresponding to the risk exchange between the agents with mean 1 and mean 64 losses. Next, we restrict risk-sharing to the following barbell network 2 1 3 6 5 4 and use Theorem 2.1 to compute the optimal risk-sharing matrix A∗, where onl… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

27 extracted references · 1 linked inside Pith

  1. [22]

    Peer-to-peer risk sharing with an appli- cation to flood risk pooling.Annals of Operations Research, 321(1):813–842, 2023

    Runhuan Feng, Chongda Liu, and Stephen Taylor. Peer-to-peer risk sharing with an appli- cation to flood risk pooling.Annals of Operations Research, 321(1):813–842, 2023

    2023

  2. [1]

    Multiperiod peer-to-peer risk shar- ing.Journal of Risk and Insurance, 91(4):943–982, 2024

    Samal Abdikerimova, Tim J Boonen, and Runhuan Feng. Multiperiod peer-to-peer risk shar- ing.Journal of Risk and Insurance, 91(4):943–982, 2024

    2024

  3. [2]

    Peer-to-peer multi-risk insurance and mutual aid

    Samal Abdikerimova and Runhuan Feng. Peer-to-peer multi-risk insurance and mutual aid. European Journal of Operational Research, 299(2):735–749, 2022

    2022

  4. [3]

    International catastrophe pooling for extreme weather

    Andreas Bollmann and Shaun S Wang. International catastrophe pooling for extreme weather. Society of Actuaries, 2019

    2019

  5. [4]

    Peer-to-peer risk-sharing schemes with heterogeneity and infinite-mean losses.Available at SSRN 5013193, 2025

    Tim J Boonen and Ka Long Chiu. Peer-to-peer risk-sharing schemes with heterogeneity and infinite-mean losses.Available at SSRN 5013193, 2025

    2025

  6. [5]

    Robust peer-to-peer risk sharing in continuous time.Available at SSRN 5957416, 2025

    Tim J Boonen and Ziqi Zhou. Robust peer-to-peer risk sharing in continuous time.Available at SSRN 5957416, 2025

    2025

  7. [6]

    An attempt to determine the optimum amount of stop loss reinsurance.Trans- actions of the 16th International Congress of Actuaries, 2:597–610, 1960

    Karl Borch. An attempt to determine the optimum amount of stop loss reinsurance.Trans- actions of the 16th International Congress of Actuaries, 2:597–610, 1960

    1960

  8. [7]

    Equilibrium in a reinsurance market.Econometrica, pages 424–444, 1962

    Karl Borch. Equilibrium in a reinsurance market.Econometrica, pages 424–444, 1962

    1962

Show all 27 references
  1. [8]

    General equilibrium in the economics of uncertainty

    Karl Borch. General equilibrium in the economics of uncertainty. InRisk and Uncertainty: Proceedings of a Conference held by the International Economic Association, pages 247–264. Springer, 1968

    1968

  2. [9]

    Cambridge University Press, 2004

    Stephen P Boyd and Lieven Vandenberghe.Convex optimization. Cambridge University Press, 2004

    2004

  3. [10]

    Collaborative insurance sustainability and network structure.arXiv preprint arXiv:2107.02764, 2021

    Arthur Charpentier, Lariosse Kouakou, Matthias L¨ owe, Philipp Ratz, and Franck Vermet. Collaborative insurance sustainability and network structure.arXiv preprint arXiv:2107.02764, 2021

    2021 arXiv

  4. [11]

    Linear risk sharing on networks.arXiv preprint arXiv:2509.21411, 2025

    Arthur Charpentier and Philipp Ratz. Linear risk sharing on networks.arXiv preprint arXiv:2509.21411, 2025

    2025

  5. [12]

    American Mathematical Soc., 1997

    Fan RK Chung.Spectral graph theory, volume 92. American Mathematical Soc., 1997

    1997

  6. [13]

    Risk sharing rule and safety loading in a peer to peer cooperative insurance model.Decisions in Economics and Finance, pages 1–14, 2024

    Gian Paolo Clemente, Susanna Levantesi, and Gabriella Piscopo. Risk sharing rule and safety loading in a peer to peer cooperative insurance model.Decisions in Economics and Finance, pages 1–14, 2024

    2024

  7. [14]

    Investing in your own and peers’ risks: The simple analytics of P2P insurance

    Michel Denuit. Investing in your own and peers’ risks: The simple analytics of P2P insurance. European Actuarial Journal, 10(2):335–359, 2020

    2020

  8. [15]

    Convex order and comonotonic conditional mean risk sharing

    Michel Denuit and Jan Dhaene. Convex order and comonotonic conditional mean risk sharing. Insurance: Mathematics and Economics, 51(2):265–270, 2012

    2012

  9. [16]

    Comonotonicity and pareto optimality, with application to collaborative insurance.Insurance: Mathematics and Economics, 120:1–16, 2025

    Michel Denuit, Jan Dhaene, Mario Ghossoub, and Christian Y Robert. Comonotonicity and pareto optimality, with application to collaborative insurance.Insurance: Mathematics and Economics, 120:1–16, 2025

    2025

  10. [17]

    Risk-sharing rules and their properties, with applications to peer-to-peer insurance.Journal of Risk and Insurance, 89(3):615–667, June 2022

    Michel Denuit, Jan Dhaene, and Christian Y Robert. Risk-sharing rules and their properties, with applications to peer-to-peer insurance.Journal of Risk and Insurance, 89(3):615–667, June 2022

    2022

  11. [18]

    From risk sharing to pure premium for a large number of heterogeneous losses.Insurance: Mathematics and Economics, 96:116–126, 2021

    Michel Denuit and Christian Y Robert. From risk sharing to pure premium for a large number of heterogeneous losses.Insurance: Mathematics and Economics, 96:116–126, 2021. OPTIMAL RISK-SHARING IN DECENTRALIZED INSURANCE 21

    2021

  12. [19]

    Risk sharing under the dominant peer-to-peer prop- erty and casualty insurance business models.Risk Management and Insurance Review, 24(2):181–205, 2021

    Michel Denuit and Christian Y Robert. Risk sharing under the dominant peer-to-peer prop- erty and casualty insurance business models.Risk Management and Insurance Review, 24(2):181–205, 2021

    2021

  13. [20]

    Pricing of cyber insurance con- tracts in a network model.ASTIN Bulletin: The Journal of the IAA, 48(3):1175–1218, 2018

    Matthias A Fahrenwaldt, Stefan Weber, and Kerstin Weske. Pricing of cyber insurance con- tracts in a network model.ASTIN Bulletin: The Journal of the IAA, 48(3):1175–1218, 2018

    2018

  14. [21]

    Decentralized insurance

    Runhuan Feng. Decentralized insurance. InDecentralized Insurance: Technical Foundation of Business Models, pages 119–139. Springer, 2023

    2023

  15. [23]

    A unified theory of decentralized insurance

    Runhuan Feng, Ming Liu, and Ning Zhang. A unified theory of decentralized insurance. Insurance: Mathematics and Economics, 119:157–178, 2024

    2024

  16. [24]

    Mutual peer-to-peer insurance: The allocation of risk.Journal of Co-operative Organization and Management, 10(1):100154, 2022

    Susanna Levantesi and Gabriella Piscopo. Mutual peer-to-peer insurance: The allocation of risk.Journal of Co-operative Organization and Management, 10(1):100154, 2022

    2022

  17. [25]

    Springer, 2019

    Adnan Malik and Karim Ullah.Introduction to takaful, volume 10. Springer, 2019

    2019

  18. [26]

    A fixed point approach for computing actuarially fair pareto optimal risk- sharing rules.European Actuarial Journal, 15(1):297–334, 2025

    Fallou Niakh. A fixed point approach for computing actuarially fair pareto optimal risk- sharing rules.European Actuarial Journal, 15(1):297–334, 2025

    2025

  19. [27]

    On the optimality of linear residual risk sharing.ASTIN Bulletin: The Journal of the IAA, pages 1–23, 2024

    Jiajie Yang and Wei Wei. On the optimality of linear residual risk sharing.ASTIN Bulletin: The Journal of the IAA, pages 1–23, 2024. Email address:fogartyh@oregonstate.edu Department of Mathematics, Oregon State University Email address:sooiehoe.loke@mtsu.edu Department of Mat...

    2024

Pith tools

Reviewed August 3, 2026 · model on record in the stance chip above.