Jump to ContentJump to Main Navigation
Noncooperative Game TheoryAn Introduction for Engineers and Computer Scientists$
Users without a subscription are not able to see the full content.

João P. Hespanha

Print publication date: 2017

Print ISBN-13: 9780691175218

Published to Princeton Scholarship Online: May 2018

DOI: 10.23943/princeton/9780691175218.001.0001

Show Summary Details
Page of

PRINTED FROM PRINCETON SCHOLARSHIP ONLINE (www.princeton.universitypressscholarship.com). (c) Copyright Princeton University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in PRSO for personal use.date: 20 September 2021

Computation of Nash Equilibria for Bimatrix Games

Computation of Nash Equilibria for Bimatrix Games

(p.118) Lecture 10 Computation of Nash Equilibria for Bimatrix Games
Noncooperative Game Theory

João P. Hespanha

Princeton University Press

This chapter discusses the computation of the Nash equilibrium for bimatrix games. It begins by considering a different version of the battle of the sexes game introduced in Chapter 9, in which action 1 corresponds to going to the baby shower and action 2 to the football game. In this new version no one really wants to go to the football game alone (cost of 3), but going to the baby shower alone is a little better (cost of 0). After finding the mixed Nash equilibrium for this case, the chapter describes the computation of a completely mixed Nash equilibrium and the numerical computation of a mixed Nash equilibrium. It concludes with a practice exercise and the corresponding solution, along with an additional exercise.

Keywords:   bimatrix game, battle of the sexes, action, mixed Nash equilibrium, completely mixed Nash equilibrium

Princeton Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us.