IDEAS home Printed from https://ideas.repec.org/p/cwl/cwldpp/575.html
   My bibliography  Save this paper

A Path Following Procedure for Finding a Point in the Core of a Balanced N-Person Game

Author

Listed:
  • Ludo Van der Heyden

Abstract

A basic theorem in n-person game theory due to Scarf states that a balanced game has a nonempty core. Scarf's proof presents a procedure to find a point in the core of a discrete game, where every coalition disposes of a finite number of alternatives. The proof for a general game follows by passing to the limit. In this paper we present a procedure which works with the characteristic sets in original form. They no longer need to be approximated. The procedure consists in following a finite sequence of possibly nonlinear paths. The framework adopted for this paper is more general than needed to treat the core problem. This enables us to present a unified approach treating the latter problem as well as related problems in linear complementarity theory and fixed point computation.

Suggested Citation

  • Ludo Van der Heyden, 1980. "A Path Following Procedure for Finding a Point in the Core of a Balanced N-Person Game," Cowles Foundation Discussion Papers 575, Cowles Foundation for Research in Economics, Yale University.
    • Handle: RePEc:cwl:cwldpp:575
    as

    Download full text from publisher

    File URL: https://cowles.yale.edu/sites/default/files/files/pub/d05/d0575.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Herbert E. Scarf, 1965. "The Core of an N Person Game," Cowles Foundation Discussion Papers 182R, Cowles Foundation for Research in Economics, Yale University.
    2. B. Curtis Eaves & Herbert Scarf, 1976. "The Solution of Systems of Piecewise Linear Equations," Mathematics of Operations Research, INFORMS, vol. 1(1), pages 1-27, February.
    Full references (including those not matched with items on IDEAS)

    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. Mamoru Kaneko, 1980. "A Necessary and Sufficient Condition for the Nonemptiness of the Cores of Partitioning Games," Cowles Foundation Discussion Papers 566, Cowles Foundation for Research in Economics, Yale University.
    2. A. Kovalenkov & M. Holtz Wooders, 1999. "An explicit bound on e for nonemptiness of e-cores of games," THEMA Working Papers 99-37, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    3. Kalai, Ehud & Postlewaite, Andrew & Roberts, John, 1979. "A group incentive compatible mechanism yielding core allocations," Journal of Economic Theory, Elsevier, vol. 20(1), pages 13-22, February.
    4. Charalambos Aliprantis & Kim Border & Owen Burkinshaw, 1996. "Market economies with many commodities," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 19(1), pages 113-185, March.
    5. Forges, Francoise & Minelli, Enrico & Vohra, Rajiv, 2002. "Incentives and the core of an exchange economy: a survey," Journal of Mathematical Economics, Elsevier, vol. 38(1-2), pages 1-41, September.
    6. Roberto Serrano, 2007. "Cooperative Games: Core and Shapley Value," Working Papers wp2007_0709, CEMFI.
    7. Nizar Allouch & Monique Florenzano, 2004. "Edgeworth and Walras equilibria of an arbitrage-free exchange economy," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 23(2), pages 353-370, January.
    8. Talman, A.J.J. & van der Heyden, L., 1981. "Algorithms for the linear complementarity problem which allow an arbitrary starting point," Research Memorandum FEW 99, Tilburg University, School of Economics and Management.
    9. Shao Sung & Dinko Dimitrov, 2007. "On Myopic Stability Concepts for Hedonic Games," Theory and Decision, Springer, vol. 62(1), pages 31-45, February.
    10. A. Kovalenkov & M. Holtz Wooders, 1999. "An explicit bound on e for nonemptiness of e-cores of games," THEMA Working Papers 99-37, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    11. Bonnisseau, Jean-Marc & Iehle, Vincent, 2007. "Payoff-dependent balancedness and cores," Games and Economic Behavior, Elsevier, vol. 61(1), pages 1-26, October.
    12. John P. Conley & Myrna Holtz Wooders, 1998. "The Tiebout Hypothesis: On the Existence of Pareto Efficient Competitive Equilibrium," Working Papers mwooders-98-06, University of Toronto, Department of Economics.
    13. de Clippel, Geoffroy, 2007. "The type-agent core for exchange economies with asymmetric information," Journal of Economic Theory, Elsevier, vol. 135(1), pages 144-158, July.
    14. Dinko Dimitrov & Peter Borm & Ruud Hendrickx & Shao Sung, 2006. "Simple Priorities and Core Stability in Hedonic Games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 26(2), pages 421-433, April.
    15. Kaneko, Mamoru, 1982. "The central assignment game and the assignment markets," Journal of Mathematical Economics, Elsevier, vol. 10(2-3), pages 205-232, September.
    16. John Chipman, 2006. "Pareto and contemporary economic theory," International Review of Economics, Springer;Happiness Economics and Interpersonal Relations (HEIRS), vol. 53(4), pages 451-475, December.
    17. McKenzie, Lionel W, 1981. "The Classical Theorem on Existence of Competitive Equilibrium," Econometrica, Econometric Society, vol. 49(4), pages 819-841, June.
    18. Iehle, Vincent, 2007. "The core-partition of a hedonic game," Mathematical Social Sciences, Elsevier, vol. 54(2), pages 176-185, September.
    19. Page Jr., Frank H. & Wooders, Myrna, 2009. "Strategic basins of attraction, the path dominance core, and network formation games," Games and Economic Behavior, Elsevier, vol. 66(1), pages 462-487, May.
    20. Fan‐Chin Kung, 2006. "An Algorithm for Stable and Equitable Coalition Structures with Public Goods," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 8(3), pages 345-355, August.

    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:cwl:cwldpp:575. 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: Brittany Ladd (email available below). General contact details of provider: https://edirc.repec.org/data/cowleus.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.