Journal ArticleOPEN ACCESS

The Set of Nash Equilibria of a Supermodular Game Is a Complete Lattice

Games and Economic Behavior (1994) 7(2) 295-300
DOI: 10.1006/game.1994.1051
83Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A Tarski-type fixed point theorem for an ascending correspondence on a complete lattice is proved and then applied to show that the set of Nash equilibria of a supermodular game is a complete lattice. Journal of Economic Literature Classification Number: C70, C72. © 1994 Academic Press. All rights reserved.

Cite

CITATION STYLE

APA

Zhou, L. (1994). The Set of Nash Equilibria of a Supermodular Game Is a Complete Lattice. Games and Economic Behavior, 7(2), 295–300. https://doi.org/10.1006/game.1994.1051

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free