IDEAS home Printed from https://ideas.repec.org/a/ier/iecrev/v35y1994i2p347-59.html
   My bibliography  Save this article

Viable Proposals

Author

Listed:
  • Sengupta, Abhijit
  • Sengupta, Kunal

Abstract

The authors propose a solution concept--which they call viable proposals--for games in coalitional form that endogenously determines a coalition structure together with an associated set of payoff configurations as parts of the solution. They show that there is at least one viable proposal for every game; further, whenever a game has a nonempty core, the set of payoff configurations identified by the solution coincides with the core of the game. Finally, given any arbitrary coalition structure and payoff configuration, a viable proposal can be reached in finitely many steps of successive domination even when the core of the game is empty. Copyright 1994 by Economics Department of the University of Pennsylvania and the Osaka University Institute of Social and Economic Research Association.

Suggested Citation

  • Sengupta, Abhijit & Sengupta, Kunal, 1994. "Viable Proposals," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 35(2), pages 347-359, May.
    • Handle: RePEc:ier:iecrev:v:35:y:1994:i:2:p:347-59
    as

    Download full text from publisher

    File URL: http://links.jstor.org/sici?sici=0020-6598%28199405%2935%3A2%3C347%3AVP%3E2.0.CO%3B2-K&origin=repec
    File Function: full text
    Download Restriction: Access to full text is restricted to JSTOR subscribers. See http://www.jstor.org for details.
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Stef Tijs & Anne van den Nouweland & Bhaskar Dutta, 1998. "Link formation in cooperative situations," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(2), pages 245-256.
    2. Herings, P. Jean-Jacques & Mauleon, Ana & Vannetelbosch, Vincent, 2009. "Farsightedly stable networks," Games and Economic Behavior, Elsevier, vol. 67(2), pages 526-541, November.
    3. Herings, P. Jean-Jacques & van der Laan, Gerard & Talman, Dolf, 2007. "The socially stable core in structured transferable utility games," Games and Economic Behavior, Elsevier, vol. 59(1), pages 85-104, April.
    4. Cesco, Juan Carlos, 2008. "A general characterization for non-balanced games in terms of U-cycles," European Journal of Operational Research, Elsevier, vol. 191(2), pages 409-415, December.
    5. Koczy, Laszlo A. & Lauwers, Luc, 2004. "The coalition structure core is accessible," Games and Economic Behavior, Elsevier, vol. 48(1), pages 86-93, July.
    6. László Á. Kóczy, 2018. "Partition Function Form Games," Theory and Decision Library C, Springer, number 978-3-319-69841-0, July.
    7. Kóczy Á., László, 2006. "A Neumann-féle játékelmélet [Neumanns game theory]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(1), pages 31-45.
    8. Yi-You Yang, 2020. "On the characterizations of viable proposals," Theory and Decision, Springer, vol. 89(4), pages 453-469, November.
    9. Koczy, Laszlo A. & Lauwers, Luc, 2007. "The minimal dominant set is a non-empty core-extension," Games and Economic Behavior, Elsevier, vol. 61(2), pages 277-298, November.
    10. Sylvain Béal & Eric Rémila & Philippe Solal, 2013. "Accessibility and stability of the coalition structure core," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(2), pages 187-202, October.
    11. Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.
    12. Herings, P. Jean-Jacques & Kóczy, László Á., 2021. "The equivalence of the minimal dominant set and the myopic stable set for coalition function form games," Games and Economic Behavior, Elsevier, vol. 127(C), pages 67-79.
    13. Koczy, Laszlo A., 2006. "The core can be accessed with a bounded number of blocks," Journal of Mathematical Economics, Elsevier, vol. 43(1), pages 56-64, December.
    14. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2011. "On the number of blocks required to access the coalition structure core," MPRA Paper 29755, University Library of Munich, Germany.
    15. Bollen, P.W.L. & Simons, John, 2005. "A synthesis of Quality Criteria for requirements Elicitation Methods," Research Memorandum 042, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    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:ier:iecrev:v:35:y:1994:i:2:p:347-59. 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: Wiley-Blackwell Digital Licensing or the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/deupaus.html .

    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.