IDEAS home Printed from https://ideas.repec.org/a/oup/restud/v60y1993i2p463-477..html
   My bibliography  Save this article

A Noncooperative Theory of Coalitional Bargaining

Author

Listed:
  • Kalyan Chatterjee
  • Bhaskar Dutta
  • Debraj Ray
  • Kunal Sengupta

Abstract

We explore a sequential offers model of n-person coalitional bargaining with transferable utility and with time discounting. Our focus is on the efficiency properties of stationary equilibria of strictly superadditive games, when the discount factor δ is sufficiently large; we do, however, consider examples of other games where subgame perfectness alone is employed. It is shown that delay and the formation of inefficient subcoalitions can occur in equilibrium, the latter for some or all orders of proposer. However, efficient stationary equilibrium payoffs converge to a point in the core, as δ → 1. Strict convexity is a sufficient condition for there to exist an efficient stationary equilibrium payoff vector for sufficiently high δ. This vector converges as δ → 1 to the egalitarian allocation of Dutta and Ray (1989).

Suggested Citation

  • Kalyan Chatterjee & Bhaskar Dutta & Debraj Ray & Kunal Sengupta, 1993. "A Noncooperative Theory of Coalitional Bargaining," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 60(2), pages 463-477.
  • Handle: RePEc:oup:restud:v:60:y:1993:i:2:p:463-477.
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.2307/2298067
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    More about this item

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    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:oup:restud:v:60:y:1993:i:2:p:463-477.. 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: Oxford University Press (email available below). General contact details of provider: https://academic.oup.com/restud .

    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.