Abstract
This paper uses properties of the logistic quantal response equilibrium correspondence to compute Nash equilibria in finite games. It is shown that branches of the correspondence may be numerically traversed efficiently and securely. The method can be implemented on a multicomputer, allowing for application to large games. The path followed by the method has an interpretation analogous to that of Harsanyi and Selten's Tracing Proecdure. As an application, it is shown that the principal branch of any quantal response equilibrium correspondence satisfying a monotonicity property converges to the risk-dominant equilibrium in 2 × 2 games.
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 callDisclaimer: 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.
