Author
Abstract
We study global uniqueness of competitive equilibrium in two-good pure-exchange economies with heterogeneous impatience types and a common HARA Bernoulli utility. The paper connects the CRRA sorting result of \citet{GeanakoplosWalsh2018} with the line of HARA uniqueness results developed in \citet{LoiMatta2022,LoiMatta2024}. In the CRRA case, ordered endowments provide a sorting mechanism for uniqueness. In the HARA case, uniqueness is known to hold for arbitrary endowments under the curvature bound $\gamma\le I/(I-1)$, where $I$ is the number of impatience types. For two types, the curvature restriction can be removed under a monotone sorting condition linking patience and endowment composition. The present paper shows that this high-curvature HARA sorting mechanism is not specific to the two-type case. Our main result proves global uniqueness for any finite number of impatience types and any $\gamma>1$. If types can be ordered so that more patient agents hold weakly more of the first good and weakly less of the second, then the equilibrium price is globally unique. Thus the paper extends the two-type high-curvature HARA result to a genuinely multi-type setting and complements the arbitrary-endowment low-curvature result by replacing the low-curvature restriction with an economically interpretable sorting restriction. In the CRRA subcase ($b=0$), the ordered-endowment condition coincides with that of \citet{GeanakoplosWalsh2018}, and our corollary recovers their uniqueness result. The contribution of the present paper is therefore not the sorting condition itself but its reach: the same ordered heterogeneity in patience and endowment composition rules out multiplicity throughout the shifted HARA case ($b>0$), for any finite number of types and any $\gamma>1$, through a global coefficient-ratio argument.
Suggested Citation
Andrea Loi & Stefano Matta, 2026.
"Sorting and Global Uniqueness in Two-Good HARA Economies with Many Patience Types,"
Papers
2606.11377, arXiv.org.
Handle:
RePEc:arx:papers:2606.11377
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2606.11377. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.