IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v68y2017icp1-12.html
   My bibliography  Save this article

Strong Nash equilibrium in games with common and complementary local utilities

Author

Listed:
  • Kukushkin, Nikolai S.

Abstract

A rather general class of strategic games is described where the coalitional improvements are acyclic and hence strong Nash equilibria exist: The players derive their utilities from the use of certain facilities; all players using a facility extract the same amount of local utility therefrom, which amount depends both on the set of users and on their actions, and is decreasing in the set of users; the ultimate utility of each player is the minimum of the local utilities at all relevant facilities. Two important subclasses are “games with structured utilities,” basic properties of which were discovered in 1970s and 1980s, and “bottleneck congestion games,” which attracted researchers’ attention quite recently. The former games are representative in the sense that every game from the whole class is isomorphic to one of them. The necessity of the minimum aggregation for the existence of strong Nash equilibria, actually, just Pareto optimal Nash equilibria, in all games of this type is established.

Suggested Citation

  • Kukushkin, Nikolai S., 2017. "Strong Nash equilibrium in games with common and complementary local utilities," Journal of Mathematical Economics, Elsevier, vol. 68(C), pages 1-12.
  • Handle: RePEc:eee:mateco:v:68:y:2017:i:c:p:1-12
    DOI: 10.1016/j.jmateco.2016.11.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406816302385
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.jmateco.2016.11.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Epstein, Amir & Feldman, Michal & Mansour, Yishay, 2009. "Strong equilibrium in cost sharing connection games," Games and Economic Behavior, Elsevier, vol. 67(1), pages 51-68, September.
    2. Nikolai Kukushkin, 2007. "Congestion games revisited," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(1), pages 57-83, September.
    3. Le Breton, Michel & Weber, Shlomo, 2011. "Games of social interactions with local and global externalities," Economics Letters, Elsevier, vol. 111(1), pages 88-90, April.
    4. Cornes, Richard & Hartley, Roger, 2007. "Weak links, good shots and other public good games: Building on BBV," Journal of Public Economics, Elsevier, vol. 91(9), pages 1684-1707, September.
    5. Deschamps, Robert & Gevers, Louis, 1978. "Leximin and utilitarian rules: A joint characterization," Journal of Economic Theory, Elsevier, vol. 17(2), pages 143-163, April.
    6. Milchtaich, Igal, 1996. "Congestion Games with Player-Specific Payoff Functions," Games and Economic Behavior, Elsevier, vol. 13(1), pages 111-124, March.
    7. Claude D'Aspremont & Louis Gevers, 1977. "Equity and the Informational Basis of Collective Choice," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 44(2), pages 199-209.
    8. Boncinelli, Leonardo & Pin, Paolo, 2012. "Stochastic stability in best shot network games," Games and Economic Behavior, Elsevier, vol. 75(2), pages 538-554.
    9. Smith, Tony E, 1974. "On the Existence of Most-Preferred Alternatives," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 15(1), pages 184-194, February.
    10. Jack Hirshleifer, 1983. "From weakest-link to best-shot: The voluntary provision of public goods," Public Choice, Springer, vol. 41(3), pages 371-386, January.
    11. Monderer, Dov & Shapley, Lloyd S., 1996. "Potential Games," Games and Economic Behavior, Elsevier, vol. 14(1), pages 124-143, May.
    12. Harks, Tobias & Klimm, Max, 2015. "Equilibria in a class of aggregative location games," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 211-220.
    13. W. M. Gorman, 1968. "The Structure of Utility Functions," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 35(4), pages 367-390.
    14. Konishi, Hideo & Le Breton, Michel & Weber, Shlomo, 1997. "Equilibria in a Model with Partial Rivalry," Journal of Economic Theory, Elsevier, vol. 72(1), pages 225-237, January.
    15. Kukushkin, Nikolai S., 2008. "Maximizing an interval order on compact subsets of its domain," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 195-206, September.
    16. Holzman, Ron & Law-Yone, Nissan, 1997. "Strong Equilibrium in Congestion Games," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 85-101, October.
    17. Kukushkin, Nikolai S, 1992. "On Existence of Stable and Efficient Outcomes in Games with Public and Private Objectives," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(3), pages 295-303.
    18. Tobias Harks & Max Klimm & Rolf Möhring, 2013. "Strong equilibria in games with the lexicographical improvement property," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 461-482, May.
    19. Holzman, Ron & Law-yone (Lev-tov), Nissan, 2003. "Network structure and strong equilibrium in route selection games," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 193-205, October.
    20. Nikolai Kukushkin, 2011. "Nash equilibrium in compact-continuous games with a potential," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 387-392, May.
    21. Ron Holzman & Dov Monderer, 2015. "Strong equilibrium in network congestion games: increasing versus decreasing costs," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 647-666, August.
    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. Kukushkin, Nikolai, 2019. "Quasiseparable aggregation in games with common local utilities," MPRA Paper 93588, University Library of Munich, Germany.
    2. Kukushkin, Nikolai S., 2018. "A universal construction generating potential games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 331-340.
    3. Nikolai S. Kukushkin, 2021. "Monotone comparative statics on semilattices," Economics Bulletin, AccessEcon, vol. 41(3), pages 1711-1718.
    4. Nikolai S. Kukushkin, 2017. "Inseparables: exact potentials and addition," Economics Bulletin, AccessEcon, vol. 37(2), pages 1176-1181.

    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. Kukushkin, Nikolai S., 2014. "Strong equilibrium in games with common and complementary local utilities," MPRA Paper 55499, University Library of Munich, Germany.
    2. Kukushkin, Nikolai S., 2018. "A universal construction generating potential games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 331-340.
    3. 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.
    4. Kukushkin, Nikolai, 2019. "Quasiseparable aggregation in games with common local utilities," MPRA Paper 93588, University Library of Munich, Germany.
    5. Kukushkin, Nikolai S., 2014. "Rosenthal's potential and a discrete version of the Debreu--Gorman Theorem," MPRA Paper 54171, University Library of Munich, Germany.
    6. Nikolai Kukushkin, 2007. "Congestion games revisited," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(1), pages 57-83, September.
    7. Nikolai Kukushkin, 2011. "Acyclicity of improvements in finite game forms," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 147-177, February.
    8. Kukushkin, Nikolai S., 2015. "Cournot tatonnement and potentials," Journal of Mathematical Economics, Elsevier, vol. 59(C), pages 117-127.
    9. 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.
    10. Yannai A. Gonczarowski & Moshe Tennenholtz, 2014. "Cascading to Equilibrium: Hydraulic Computation of Equilibria in Resource Selection Games," Discussion Paper Series dp673, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    11. Le Breton, Michel & Weber, Shlomo, 2009. "Existence of Pure Strategies Nash Equilibria in Social Interaction Games with Dyadic Externalities," CEPR Discussion Papers 7279, C.E.P.R. Discussion Papers.
    12. Igal Milchtaich, 2015. "Network topology and equilibrium existence in weighted network congestion games," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 515-541, August.
    13. Tobias Harks & Max Klimm & Rolf Möhring, 2013. "Strong equilibria in games with the lexicographical improvement property," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 461-482, May.
    14. Le Breton, Michel & Weber, Shlomo, 2011. "Games of social interactions with local and global externalities," Economics Letters, Elsevier, vol. 111(1), pages 88-90, April.
    15. Ron Holzman & Dov Monderer, 2015. "Strong equilibrium in network congestion games: increasing versus decreasing costs," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 647-666, August.
    16. Nikolai Kukushkin, 2015. "The single crossing conditions for incomplete preferences," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(1), pages 225-251, February.
    17. Arnold, Tone & Wooders, Myrna, 2002. "Dynamic Club Formation with Coordination," Economic Research Papers 269414, University of Warwick - Department of Economics.
    18. Xujin Chen & Zhuo Diao & Xiaodong Hu, 2022. "On weak Pareto optimality of nonatomic routing networks," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1705-1723, October.
    19. Alejandro Caparrós & Michael Finus, 2020. "Public good agreements under the weakest‐link technology," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 22(3), pages 555-582, June.
    20. Holzman, Ron & Law-Yone, Nissan, 1997. "Strong Equilibrium in Congestion Games," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 85-101, October.

    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:mateco:v:68:y:2017:i:c:p:1-12. 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/jmateco .

    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.