Jump to ContentJump to Main Navigation
Barley, Gold, or FiatToward a Pure Theory of Money$
Users without a subscription are not able to see the full content.

Thomas Quint and Martin Shubik

Print publication date: 2014

Print ISBN-13: 9780300188158

Published to Yale Scholarship Online: May 2014

DOI: 10.12987/yale/9780300188158.001.0001

Show Summary Details
Page of

PRINTED FROM YALE SCHOLARSHIP ONLINE (www.yale.universitypressscholarship.com). (c) Copyright Yale University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in YSO for personal use.date: 24 September 2021

Oligopolistic Competition with Cash and with a Money Market

Oligopolistic Competition with Cash and with a Money Market

Chapter:
(p.152) Chapter 12 Oligopolistic Competition with Cash and with a Money Market
Source:
Barley, Gold, or Fiat
Author(s):

Thomas Quint

Martin Shubik

Publisher:
Yale University Press
DOI:10.12987/yale/9780300188158.003.0012

We consider a variation in which there are a finite number of traders. To be precise, there are n types of trader and n commodities. Each trader of type k begins with a units of commodity k, k = 1,...,n, and has an “nth root” utility function. There are K traders of each type. We can derive formulas for the solution in the case where players are endowed with “enough money.” In the case where n = 2 and K --> infinity, the model approaches the Basic Model from chapter 3, and our solutions reduce to those for the Basic Model. We close with some comments regarding a money market version of the model.

Keywords:   finite number of traders, oligopolistic money market, oligopolistic trade

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