IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v37y1999i2p189-204.html
   My bibliography  Save this article

A necessary and sufficient condition for the convexity in oligopoly games

Author

Listed:
  • Zhao, Jingang

Abstract

No abstract is available for this item.

Suggested Citation

  • Zhao, Jingang, 1999. "A necessary and sufficient condition for the convexity in oligopoly games," Mathematical Social Sciences, Elsevier, vol. 37(2), pages 189-204, March.
    • Handle: RePEc:eee:matsoc:v:37:y:1999:i:2:p:189-204
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(98)00019-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Inarra, Elena & Usategui, Jose M, 1993. "The Shapley Value and Average Convex Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 22(1), pages 13-29.
    2. Sprumont, Yves, 1990. "Population monotonic allocation schemes for cooperative games with transferable utility," Games and Economic Behavior, Elsevier, vol. 2(4), pages 378-394, December.
    3. SCHMEIDLER, David, 1969. "The nucleolus of a characteristic function game," LIDAM Reprints CORE 44, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Other publications TiSEM cd695be5-0f54-4548-a952-2, Tilburg University, School of Economics and Management.
    5. Driessen, T.S.H. & Tijs, S.H., 1985. "The t-value, the core and semiconvex games," Other publications TiSEM 016b6b5d-a476-44ca-bd05-7, Tilburg University, School of Economics and Management.
    6. Jingang Zhao, 1998. "Non-Empty Core as a Precondition for Horizontal Merger: Core Existence without Using Balancedness," Working Papers 98-07, Ohio State University, Department of Economics.
    7. Liqun Qi, 1988. "Odd Submodular Functions, Dilworth Functions and Discrete Convex Functions," Mathematics of Operations Research, INFORMS, vol. 13(3), pages 435-446, August.
    8. Ichiishi, Tatsuro, 1981. "Super-modularity: Applications to convex games and to the greedy algorithm for LP," Journal of Economic Theory, Elsevier, vol. 25(2), pages 283-286, October.
    9. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
    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. Norde, Henk & Pham Do, Kim Hang & Tijs, Stef, 2002. "Oligopoly games with and without transferable technologies," Mathematical Social Sciences, Elsevier, vol. 43(2), pages 187-207, March.
    2. Meinhardt, Holger Ingmar, 2020. "On the Replication of the Pre-Kernel and Related Solutions," MPRA Paper 102676, University Library of Munich, Germany.
    3. Kumoi, Yuki & Matsubayashi, Nobuo, 2014. "Vertical integration with endogenous contract leadership: Stability and fair profit allocation," European Journal of Operational Research, Elsevier, vol. 238(1), pages 221-232.
    4. Aymeric Lardon, 2012. "The γ-core in Cournot oligopoly TU-games with capacity constraints," Theory and Decision, Springer, vol. 72(3), pages 387-411, March.
    5. Theo Driessen & Dongshuang Hou & Aymeric Lardon, 2011. "Stackelberg oligopoly TU-games: characterization of the core and 1-concavity of the dual game," Working Papers halshs-00610840, HAL.
    6. Aymeric Lardon, 2014. "A partial characterization of the core in Bertrand oligopoly TU-games with transferable technologies," Working Papers hal-01081803, HAL.
    7. Dongshuang Hou & Theo Driessen & Aymeric Lardon, 2011. "Convexity and the Shapley value in Bertrand oligopoly TU-games with Shubik's demand functions," Working Papers halshs-00610838, HAL.
    8. Artem Sedakov, 2020. "Characteristic Function and Time Consistency for Two-Stage Games with Network Externalities," Mathematics, MDPI, vol. 8(1), pages 1-9, January.
    9. Driessen, Theo S.H. & Meinhardt, Holger I., 2005. "Convexity of oligopoly games without transferable technologies," Mathematical Social Sciences, Elsevier, vol. 50(1), pages 102-126, July.
    10. Takeda, Kohei & Hosoe, Toyoki & Watanabe, Takayuki & Matsubayashi, Nobuo, 2018. "Stability analysis of horizontal mergers in a market with asymmetric substitutability," Mathematical Social Sciences, Elsevier, vol. 96(C), pages 73-84.
    11. Dongshuang Hou & Aymeric Lardon & T. S. H. Driessen, 2017. "Stackelberg Oligopoly TU-Games: Characterization and Nonemptiness of the Core," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 19(04), pages 1-16, December.
    12. Trine Tornøe Platz & Lars Peter Østerdal, 2013. "Forming and Dissolving Partnerships in Cooperative Game Situations," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 15(2), pages 208-228, April.
    13. Aymeric Lardon, 2020. "Convexity of Bertrand oligopoly TU-games with differentiated products," Annals of Operations Research, Springer, vol. 287(1), pages 285-302, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Brânzei, R. & Dimitrov, D.A. & Tijs, S.H., 2002. "Convex Fuzzy Games and Participation Monotonic Allocation Schemes," Discussion Paper 2002-13, Tilburg University, Center for Economic Research.
    2. Ruud Hendrickx & Jacco Thijssen & Peter Borm, 2012. "Minimum cost spanning tree games and spillover stability," Theory and Decision, Springer, vol. 73(3), pages 441-451, September.
    3. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    4. Hendrickx, R.L.P. & Borm, P.E.M. & Timmer, J.B., 2000. "On Convexity for NTU-Games," Discussion Paper 2000-108, Tilburg University, Center for Economic Research.
    5. Rodica Brânzei & Vito Fragnelli & Stef Tijs, 2002. "Tree-connected peer group situations and peer group games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 55(1), pages 93-106, March.
    6. Ruud Hendrickx & Judith Timmer & Peter Borm, 2002. "A note on NTU convexity," International Journal of Game Theory, Springer;Game Theory Society, vol. 31(1), pages 29-37.
    7. Cristina Fernández & Peter Borm & Ruud Hendrickx & Stef Tijs, 2005. "Drop out monotonic rules for sequencing situations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 61(3), pages 501-504, July.
    8. Lohmann, E.R.M.A. & Borm, P.E.M. & Slikker, M., 2010. "Preparation Sequencing Situations and Related Games," Discussion Paper 2010-31, Tilburg University, Center for Economic Research.
    9. Fragnelli, V. & Llorca, N. & Sánchez-Soriano, J. & Tijs, S.H., 2006. "Convex Games with Countable Number of Players and Sequencing Situations," Discussion Paper 2006-119, Tilburg University, Center for Economic Research.
    10. Estevez Fernandez, M.A. & Mosquera, M.A. & Borm, P.E.M. & Hamers, H.J.M., 2006. "Proportionate Flow Shop Games," Discussion Paper 2006-63, Tilburg University, Center for Economic Research.
    11. Takaaki Abe & Satoshi Nakada, 2023. "Core stability of the Shapley value for cooperative games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 60(4), pages 523-543, May.
    12. Min Ji & Sai Liu & Xiaolin Zhang & Keke Cao & T. C. E. Cheng, 2017. "Sequencing Games with Slack Due Windows and Group Technology Considerations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 121-133, February.
    13. Edwin Lohmann & Peter Borm & Marco Slikker, 2014. "Sequencing situations with Just-in-Time arrival, and related games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(3), pages 285-305, December.
    14. Hamers, H.J.M. & Miquel, S. & Norde, H.W., 2011. "Monotonic Stable Solutions for Minimum Coloring Games," Discussion Paper 2011-016, Tilburg University, Center for Economic Research.
    15. Arantza Estévez-Fernández & Peter Borm & Pedro Calleja & Herbert Hamers, 2008. "Sequencing games with repeated players," Annals of Operations Research, Springer, vol. 158(1), pages 189-203, February.
    16. Herbert Hamers & Flip Klijn & Bas van Velzen, 2002. "On Games corresponding to Sequencing Situations with Precedence Relations," UFAE and IAE Working Papers 553.02, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
    17. Stef Tijs & Gert-Jan Otten, 1993. "Compromise values in cooperative game theory," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 1(1), pages 1-36, December.
    18. Voorneveld, Mark & Grahn, Sofia, 2001. "A Minimal Test for Convex Games and the Shapley Value," Working Paper Series 2001:2, Uppsala University, Department of Economics.
    19. Csóka, Péter & Jean-Jacques Herings, P. & Kóczy, László Á. & Pintér, Miklós, 2011. "Convex and exact games with non-transferable utility," European Journal of Operational Research, Elsevier, vol. 209(1), pages 57-62, February.
    20. Flip Klijn & Stef Tijs & Marco Slikker, 2001. "A Dual Egalitarian Solution," Economics Bulletin, AccessEcon, vol. 3(10), pages 1-8.

    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:eee:matsoc:v:37:y:1999:i:2:p:189-204. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.