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

N-Player Games

N-Player Games

(p.127) Lecture 11 N-Player Games
Noncooperative Game Theory

João P. Hespanha

Princeton University Press

This chapter extends several of the concepts for two-player games to games with N-players. It begins by considering general games with N players P₁, P₂, . . ., P(subscript N), which are allowed to select policies within action spaces Γ‎₁, Γ‎₂, . . ., Γ‎(subscript N). Each player wants to minimize their own outcome, and does not care about the outcome of the other players. The chapter proceeds by discussing the security level, security policy, and Nash equilibrium for N-player games, pure N-player games in normal form, mixed policy for N-player games in normal form, and computation of the completely mixed Nash equilibrium for N-player games. A mixed Nash equilibrium is computed for a different game in which some (or all) players want to maximize instead of minimize the outcome.

Keywords:   security level, security policy, Nash equilibrium, N-player game, pure N-player game, mixed policy, 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.