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: 04 December 2021

Games in Extensive Form

Games in Extensive Form

(p.71) Lecture 7 Games in Extensive Form
Noncooperative Game Theory

João P. Hespanha

Princeton University Press

This chapter discusses a number of key concepts for extensive form game representation. It first considers a matrix that defines a zero-sum matrix game for which the minimizer has two actions and the maximizer has three actions and shows that the matrix description, by itself, does not capture the information structure of the game and, in fact, other information structures are possible. It then describes an extensive form representation of a zero-sum two-person game, which is a decision tree, the extensive form representation of multi-stage games, and the notions of security policy, security level, and saddle-point equilibrium for a game in extensive form. It also explores the matrix form for games in extensive form, recursive computation of equilibria for single-stage games, feedback games, feedback saddle-point for multi-stage games, and recursive computation of equilibria for multi-stage games. It concludes with a practice exercise with the corresponding solution, along with additional exercises.

Keywords:   extensive form game representation, zero-sum matrix, zero-sum two-person, multi-stage game, security policy, security level, saddle-point equilibrium, single-stage game, feedback game, recursive computation

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.