IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v31y2002i1p39-45.html
   My bibliography  Save this article

On computational complexity of membership test in flow games and linear production games

Author

Listed:
  • Shanfeng Zhu

    (Department of Computer Science, City University of Hong Kong, Hong Kong, P. R. China)

  • Xiaotie Deng

    (Department of Computer Science, City University of Hong Kong, Hong Kong, P. R. China)

  • Maocheng Cai

    (Institute of Systems Science, Chinese Academy of Sciences, Beijing 100080, P. R. China)

  • Qizhi Fang

    (Department of Mathematics, Ocean University of Qingdao, Qingdao 266003, P. R. China)

Abstract

Let \equiv(N,v) be a cooperative game with the player set N and characteristic function v: 2N ->R. An imputation of the game is in the core if no subset of players could gain advantage by splitting from the grand coalition of all players. It is well known that, for the flow game (and equivalently, for the linear production game), the core is always non-empty and a solution in the core can be found in polynomial time. In this paper, we show that, given an imputation x, it is NP-complete to decide x is not a member of the core, for the flow game. And because of the specific reduction we constructed, the result also holds for the linear production game.

Suggested Citation

  • Shanfeng Zhu & Xiaotie Deng & Maocheng Cai & Qizhi Fang, 2002. "On computational complexity of membership test in flow games and linear production games," International Journal of Game Theory, Springer;Game Theory Society, vol. 31(1), pages 39-45.
  • Handle: RePEc:spr:jogath:v:31:y:2002:i:1:p:39-45 Note: Received: October 2000/Final version: March 2002
    as

    Download full text from publisher

    File URL: http://link.springer.de/link/service/journals/00182/papers/2031001/20310039.pdf
    Download Restriction: Access to the full text of the articles in this series is restricted

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

    References listed on IDEAS

    as
    1. Mertens,Jean-François & Sorin,Sylvain & Zamir,Shmuel, 2015. "Repeated Games," Cambridge Books, Cambridge University Press, number 9781107662636, November.
      • Mertens,Jean-François & Sorin,Sylvain & Zamir,Shmuel, 2015. "Repeated Games," Cambridge Books, Cambridge University Press, number 9781107030206, December.
    2. MERTENS, Jean-François & ZAMIR, Shmuel, 1995. "Incomplete Information Games and the Normal Distribution," CORE Discussion Papers 1995020, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Kyle, Albert S, 1985. "Continuous Auctions and Insider Trading," Econometrica, Econometric Society, vol. 53(6), pages 1315-1335, November.
    4. CALCAGNO, Riccardo & LOVO, Stefano M., 1998. "Bid-ask price competition with asymmetric information between market makers," CORE Discussion Papers 1998016, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Calcagno, Riccardo & Lovo, Stefano M., 1998. "Bid-Ask Price Competition with Asymmetric Information between Market Makers," Discussion Papers (IRES - Institut de Recherches Economiques et Sociales) 1998012, Université catholique de Louvain, Institut de Recherches Economiques et Sociales (IRES).
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Computability of simple games: A complete investigation of the sixty-four possibilities," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 150-158, March.
    2. Potters, Jos & Reijnierse, Hans & Biswas, Amit, 2006. "The nucleolus of balanced simple flow networks," Games and Economic Behavior, Elsevier, vol. 54(1), pages 205-225, January.
    3. Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 348-366, February.
    4. Mohammaditabar, Davood & Ghodsypour, Seyed Hassan & Hafezalkotob, Ashkan, 2016. "A game theoretic analysis in capacity-constrained supplier-selection and cooperation by considering the total supply chain inventory costs," International Journal of Production Economics, Elsevier, vol. 181(PA), pages 87-97.
    5. Demuynck, Thomas, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 425-433.
    6. Drechsel, J. & Kimms, A., 2010. "Computing core allocations in cooperative games with an application to cooperative procurement," International Journal of Production Economics, Elsevier, vol. 128(1), pages 310-321, November.

    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:spr:jogath:v:31:y:2002:i:1:p:39-45. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.