Abstract
This paper provides techniques for using stable sets to characterize equilibria in infinite games. We demonstrate the techniques by extending the definition of Coalition Proof Nash Equilibrium. Our new definition reduces to the recursive definition of Bernheim, Peleg, and Whinston in games with a finite number of players and a finite strategy space. Unlike the old characterization, our new one maintains an equivalence between a recursive definition and a nonrecursive characterization when strategy spaces are infinite. Examples are used to demonstrate the advantages and relative simplicity of the new definition, even for games with infinite numbers of agents. Journal of Economic Literature Classification Number: 026.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
