IDEAS home Printed from https://ideas.repec.org/a/ebl/ecbull/eb-07c70039.html
   My bibliography  Save this article

Potential games with NM utilities

Author

Listed:
  • Nikolai S. Kukushkin

    (Russian Academy of Sciences, Dorodnicyn Computing Center)

Abstract

Given a game admitting an exact potential, affine transformations of utilities are described that do or do not destroy the property. All weighted potentials of a game admitting one are described.

Suggested Citation

  • Nikolai S. Kukushkin, 2008. "Potential games with NM utilities," Economics Bulletin, AccessEcon, vol. 3(17), pages 1-7.
    • Handle: RePEc:ebl:ecbull:eb-07c70039
    as

    Download full text from publisher

    File URL: http://www.accessecon.com/pubs/EB/2008/Volume3/EB-07C70039A.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Mark Voorneveld & Peter Borm & Freek Van Megen & Stef Tijs & Giovanni Facchini, 1999. "Congestion Games And Potentials Reconsidered," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 1(03n04), pages 283-299.
    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. Norde, Henk & Voorneveld, Mark, 2019. "Feasible best-response correspondences and quadratic scoring rules," SSE Working Paper Series in Economics 2019:2, Stockholm School of Economics.
    2. Zhan Wang & Jinpeng Ma & Hongwei Zhang, 2023. "Object-based unawareness: Theory and applications," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 8(1), pages 1-55, December.
    3. Voorneveld, Mark, 2019. "An axiomatization of the Nash equilibrium concept," Games and Economic Behavior, Elsevier, vol. 117(C), pages 316-321.
    4. Kukushkin, Nikolai S., 2018. "A universal construction generating potential games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 331-340.
    5. Le Breton, Michel & Shapoval, Alexander & Weber, Shlomo, 2021. "A game-theoretical model of the landscape theory," Journal of Mathematical Economics, Elsevier, vol. 92(C), pages 41-46.
    6. Roughgarden, Tim & Tardos, Eva, 2004. "Bounding the inefficiency of equilibria in nonatomic congestion games," Games and Economic Behavior, Elsevier, vol. 47(2), pages 389-403, May.
    7. 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.
    8. Fatima Khanchouche & Samir Sbabou & Hatem Smaoui & Ziad Abderrahmane, 2023. "Congestion Games with Player-Specific Payoff Functions: The Case of Two Resources, Computation and Algorithms. First version," Economics Working Paper Archive (University of Rennes 1 & University of Caen) 2023-08, Center for Research in Economics and Management (CREM), University of Rennes 1, University of Caen and CNRS.
    9. Samir Sbabou & Hatem Smaoui & Abderrahmane Ziad, 2013. "A formula for Nash equilibria in monotone singleton congestion games," Economics Bulletin, AccessEcon, vol. 33(1), pages 334-339.
    10. Nikolai Kukushkin, 2007. "Congestion games revisited," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(1), pages 57-83, September.
    11. Ryo Kawasaki & Hideo Konishi & Junki Yukawa, 2023. "Equilibria in bottleneck games," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 649-685, September.
    12. Milchtaich, Igal, 2006. "Network topology and the efficiency of equilibrium," Games and Economic Behavior, Elsevier, vol. 57(2), pages 321-346, November.
    13. Jacques Durieu & Hans Haller & Philippe Solal, 2011. "Nonspecific Networking," Games, MDPI, vol. 2(1), pages 1-27, February.
    14. Olivier Tercieux & Mark Voorneveld, 2010. "The cutting power of preparation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 71(1), pages 85-101, February.
    15. Clempner, Julio B. & Poznyak, Alexander S., 2015. "Computing the strong Nash equilibrium for Markov chains games," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 911-927.
    16. Abderrahmane ZIAD & Samir SBABOU & Hatem SMAOUI, CEMOI, 2011. "Nonsymmetric singleton congestion games: case of two resources," Economics Working Paper Archive (University of Rennes 1 & University of Caen) 201113, Center for Research in Economics and Management (CREM), University of Rennes 1, University of Caen and CNRS.
    17. repec:ebl:ecbull:v:3:y:2008:i:17:p:1-7 is not listed on IDEAS
    18. Ozan Candogan & Ishai Menache & Asuman Ozdaglar & Pablo A. Parrilo, 2011. "Flows and Decompositions of Games: Harmonic and Potential Games," Mathematics of Operations Research, INFORMS, vol. 36(3), pages 474-503, August.
    19. Lina Mallozzi, 2013. "An application of optimization theory to the study of equilibria for games: a survey," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(3), pages 523-539, September.
    20. Rabia Nessah & Guoqiang Tian, 2009. "On the Existence of Strong Nash Equilibria," Working Papers 2009-ECO-06, IESEG School of Management.
    21. Milchtaich, Igal, 2004. "Social optimality and cooperation in nonatomic congestion games," Journal of Economic Theory, Elsevier, vol. 114(1), pages 56-87, January.

    More about this item

    JEL classification:

    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory

    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:ebl:ecbull:eb-07c70039. 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: John P. Conley (email available below). General contact details of provider: .

    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.