The problem of multiple commons: A market design approach
Ryan Tierney
ISER Discussion Paper from Institute of Social and Economic Research, The University of Osaka
Abstract:
There are several locations, each of which is endowed with a resource that is specific to that location. Examples include coastal fisheries, oil fields, etc. Each agent will go to a single location and harvest some of the resource there. Several agents may go to each location. We assign harvesting rights based on preferences alone, though we later extend the model to accommodate private endowments of money. We find the best allocation rule in the class of rules that are strategy-proof, anonymous, and that satisfy a weak continuity property. We also find an ascending mechanism, similar to an auction, that implements the rule. The rule coincides with a special simulated price equilibrium, wherein agents buy their desired resource with tokens distributed by the social planner. Equilibrium price vectors form a lower semi-lattice and thus there is a unique minimal price vector. The equilibria associated with the minimal price vector are called min-price Walrasian equilibria. These equilibria form an essentially single-valued correspondence, and this correspondence is the rule we characterize.
Date: 2016-12
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
https://www.iser.osaka-u.ac.jp/static/resources/docs/dp/2016/DP0986.pdf
Related works:
Journal Article: The problem of multiple commons: A market design approach (2019) 
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:dpr:wpaper:0986
Access Statistics for this paper
More papers in ISER Discussion Paper from Institute of Social and Economic Research, The University of Osaka Contact information at EDIRC.
Bibliographic data for series maintained by Librarian ().