Abstract
A companion paper, Sanchirico (1996), provides a probabilistic theory of learning in games with the convergence property that, almost surely, play will remain almost always (i.e., forever after some point) within one of the stage game's inclusive sets. This paper investigates the size of minimal inclusive sets in several classes of games, notably, those for which other learning processes have been shown to converge (in various manners weaker than convergence of actual play). These include certain supermodular games, congestion games, potential games, games with identical interests, and games with bandwagon effects. It is shown that in all these classes, if all of a game?s pure equilibria are strict (a fortiori, if its payoffs are generic), then all of its minimal inclusive sets will be singletons consisting of Nash equilibria.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.