Jump to ContentJump to Main Navigation
Dynamic EconomicsOptimization by the Lagrange Method$
Users without a subscription are not able to see the full content.

Gregory C. Chow

Print publication date: 1997

Print ISBN-13: 9780195101928

Published to Oxford Scholarship Online: October 2011

DOI: 10.1093/acprof:oso/9780195101928.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 14 October 2019

Dynamic Games

Dynamic Games

(p.111) Chapter Six Dynamic Games
Dynamic Economics


Oxford University Press

The dynamic game theory—which is commonly used to study pricing methods in oligopolic situations—is introduced in this chapter through the dynamic optimization perspective. A model of dynamic games involves identifying two players that are both attempting to solve the standard problem of dynamic optimization through making use of a variable to denote the vector state. While the return factor and the discount factor may be specific, each player is expected to maximize a certain Lagrangean expression that is subject to a particular constraint. Depending on the empirical problems, one can utilize either the Nash solution wherein each player is to solve the optimization problem by taking the other player’s decision as given, or the Stakleberg solution which assigns a dominant player.

Keywords:   dynamic game, oligopoly, dynamic optimization, Nash solution, Stakleberg solution

Oxford 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 .