IDEAS home Printed from
   My bibliography  Save this paper

Nash equilibria in nonsymmetric singleton congestion games with exact partition


  • Abderrahmane ZIAD

    (University of Caen Basse-Normandie, CREM (UMR CNRS))

  • Samir SBABOU

    (University of Caen Basse-Normandie, CREM (UMR CNRS))

  • Hatem SMAOUI

    (CEMOI, Université de la Réunion)


We define a new class of games, which we qualify as congestion games with exact partition. These games constitute a subfamily of singleton congestion games for which the players are restricted to choose only one strategy, but they each possess their own utility function. The aim of this paper is to develop a method leading to an easier identification of all Nash equilibria in this kind of congestion games. We also give a new proof establishing the existence of a Nash equilibrium in this type of games without invoking the potential function or the finite best-reply property.

Suggested Citation

  • Abderrahmane ZIAD & Samir SBABOU & Hatem SMAOUI, 2011. "Nash equilibria in nonsymmetric singleton congestion games with exact partition," Economics Working Paper Archive (University of Rennes 1 & University of Caen) 201115, Center for Research in Economics and Management (CREM), University of Rennes 1, University of Caen and CNRS.
  • Handle: RePEc:tut:cremwp:201115

    Download full text from publisher

    File URL:
    Download Restriction: no

    References listed on IDEAS

    1. Thomas Quint & Martin Shubik, 1994. "A Model of Migration," Cowles Foundation Discussion Papers 1088, Cowles Foundation for Research in Economics, Yale University.
    2. Le Breton, M. & Weber, S., 1995. "Strong Equilibrium in a Model with Partial Rivalry," G.R.E.Q.A.M. 95a07, Universite Aix-Marseille III.
    3. Voorneveld, M. & Borm, P.E.M. & van Megen, F.J.C. & Tijs, S.H. & Facchini, G., 1999. "Congestion Games and Potentials Reconsidered," Discussion Paper 1999-98, Tilburg University, Center for Economic Research.
    4. repec:fth:tilbur:9998 is not listed on IDEAS
    5. Monderer, Dov & Shapley, Lloyd S., 1996. "Potential Games," Games and Economic Behavior, Elsevier, vol. 14(1), pages 124-143, May.
    Full references (including those not matched with items on IDEAS)

    More about this item


    Singleton congestion games; Nash equilibria; Potential function; Finite best-reply property.;

    JEL classification:

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

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    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:tut:cremwp:201115. 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: (CODA-POIREY Hélène). General contact details of provider: .

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

    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.