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

Noncooperative Games

Noncooperative Games

Chapter:
(p.3) Lecture 1 Noncooperative Games
Source:
Noncooperative Game Theory
Author(s):

João P. Hespanha

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

This chapter discusses the key principles of noncooperative game theory with the aid of several examples. To characterize a game, several items must be specified; for example, the players are the agents that make decisions. For a mathematical solution to a game, it is also important to make assumptions on the player's rationality, regarding questions such as: Will the players always pursue their best interests to fulfill their objectives? Will the players form coalitions? Will the players trust each other? The chapter proceeds by using the rope-pulling game to examine the motivation and implications of assuming a noncooperative vs. cooperative framework. It also considers the robust design problem and its formalization into a resistive circuit design game, a network routing game, and the Nash equilibrium before concluding with a practice exercise related to the network routing game, complete with solution.

Keywords:   noncooperative game theory, rope-pulling, robust design, circuit design, network routing, 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.