Review of Economic Studies Vol. 54 No. 3 1987
A Theory of Monetary Exchange
Abstract
The transactions cost for alternative exchange mechanisms for the household exchange problem can be characterized by the computational complexity of the exchange process. The computational complexity for any exchange mechanism is at least nH, where n is the number of goods and H is the number of households. Imposing the conditions of conservation, nonnegativity and quid pro quo results in a command exchange mechanism whose computational complexity is nH. Multiparty barter exchange, formalized using graph theory, has computational complexity equal to the minimum of (nH2, n2H). Introducing an auxiliary good, money, reduces the computational complexity to nH. A problem with decentralized information is demonstrated.
- DOI
- 10.2307/2297572
- Volume
- 54
- Issue
- 3
- Pages
- 499
- Sources
- bibtex:phds-export.bib openalex crossref