Abstract

We consider mechanisms that provide the opportunity to exchange commodity i for commodity j, for certain ordered pairs ij. Given any connected graph G of opportunities, we show that there is a unique “G-mechanism” that satisfies some natural conditions of “fairness” and “convenience”. Next we define time and price complexity for any G-mechanism as (respectively) the time required to exchange i for j, and the information needed to determine the exchange ratio (each for the worst pair ij). If the number of commodities exceeds three, there are precisely three minimally complex G-mechanisms, where G corresponds to the star, cycle and complete graphs. The star mechanism has a distinguished commodity — the money — that serves as the sole medium of exchange and mediates trade between decentralized markets for the other commodities. Furthermore, for any weighted sum of complexities, the star mechanism is the unique minimizer of the sum for large enough m.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.