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

Credible Nash Bargaining Solution for Bilateral Trading Networks

Author

Listed:
  • Kang Rong
  • Qianfeng Tang

Abstract

We study surplus division in network constrained bilateral matching markets with transferable utility. We introduce a new solution concept, the credible bargaining solution, which refines stability by requiring that, for each matched pair of buyer and seller, surplus be divided according to the Nash bargaining solution with respect to credible outside options, defined as their payoffs in some stable outcome of the submarket obtained by removing their link. We establish general properties of the credible bargaining solution, prove existence, and provide a complete characterization in the unit-surplus case based on the notion of essential links.

Suggested Citation

  • Kang Rong & Qianfeng Tang, 2026. "Credible Nash Bargaining Solution for Bilateral Trading Networks," Papers 2601.09198, arXiv.org.
  • Handle: RePEc:arx:papers:2601.09198
    as

    Download full text from publisher

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

    More about this item

    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:2601.09198. 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: http://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.