IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2608.09859.html

Nash Peer-to-Peer Insurance Bargaining under Price Fairness and Coalitional Stability

Author

Listed:
  • Tim J. Boonen
  • Wing Fung Chong
  • Kenneth Tsz Hin Ng
  • Tak Wa Ng

Abstract

We study peer-to-peer (P2P) insurance contracting between a risk-averse P2P reinsurer and multiple risk-averse peers in an asymmetric Nash-bargaining framework, where all agents seek to improve expected utility relative to their disagreement points. Consistent with the expected value premium principle, we impose a price-fairness condition requiring each peer's expected contribution to be based on a common loading applied to the peer's expected loss. To justify the bargaining formulation relative to a standard fixed-weight weighted-sum optimization problem, we provide an axiomatic characterization showing that the Nash bargaining solution satisfies properties well suited to voluntary P2P insurance contracting in small pools. We establish the existence and uniqueness of the optimal contract and derive first-order characterizations for the full-, partial-, and zero-reinsurance regimes. To address subgroup formation, we develop computationally tractable sufficient conditions that rule out viable coalitional deviations, both with and without price fairness. Our numerical study investigates the impact of price fairness and pool size on the optimal contract and agents' welfare. Price fairness reduces dispersion in risk allocations and certainty-equivalent loadings among peers. Regarding pool size, welfare need not increase monotonically, highlighting that risk-pool expansion depends not only on diversification but also on the evolution of bargaining power.

Suggested Citation

  • Tim J. Boonen & Wing Fung Chong & Kenneth Tsz Hin Ng & Tak Wa Ng, 2026. "Nash Peer-to-Peer Insurance Bargaining under Price Fairness and Coalitional Stability," Papers 2608.09859, arXiv.org.
  • Handle: RePEc:arx:papers:2608.09859
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2608.09859
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2608.09859. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.