Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Supermodular games

If quasi-concavity of the players payoffs cannot be verified, there is an alternative existence proof that relies on Tarski s (1955) fixed point theorem and involves the notion of supermodular games. The theory of supermodular games is a relatively recent development introduced and advanced by Topkis (1998). [Pg.24]

Theorem 3. In a supermodular game there exists at least one NE. [Pg.25]

Supermodular games approach. In some situations, supermodular games provide a more convenient tool for comparative statics. [Pg.38]

Theorem 11. Consider a collection of supermodular games on RP parameterized by a parameter a. Further, suppose d Kijdxida > 0 for all i. Then the largest and the smallest equilibria are increasing in a. [Pg.38]


See other pages where Supermodular games is mentioned: [Pg.29]    [Pg.36]    [Pg.38]    [Pg.39]    [Pg.29]    [Pg.36]    [Pg.38]    [Pg.39]    [Pg.24]    [Pg.25]    [Pg.26]    [Pg.39]   
See also in sourсe #XX -- [ Pg.24 , Pg.29 , Pg.36 , Pg.38 ]




SEARCH



GAMESS

Game, games

Supermodularity

© 2024 chempedia.info