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: 25 September 2021

Classes of Potential Games

Classes of Potential Games

Chapter:
(p.145) Lecture 13 Classes of Potential Games
Source:
Noncooperative Game Theory
Author(s):

João P. Hespanha

Publisher:
Princeton University Press
DOI:10.23943/princeton/9780691175218.003.0013

This chapter discusses several classes of potential games that are common in the literature and how to derive the Nash equilibrium for such games. It first considers identical interests games and dummy games before turning to decoupled games and bilateral symmetric games. It then describes congestion games, in which all players are equal, in the sense that the cost associated with each resource only depends on the total number of players using that resource and not on which players use it. It also presents other potential games, including the Sudoku puzzle, and goes on to analyze the distributed resource allocation problem, the computation of Nash equilibria for potential games, and fictitious play. It concludes with practice exercises and their corresponding solutions, along with additional exercises.

Keywords:   potential game, Nash equilibrium, identical interests, dummy game, decoupled game, bilateral symmetric game, congestion game, Sudoku puzzle, distributed resource allocation, fictitious play

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.