{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/necessary-and-sufficient-conditions-for-1","title":"Necessary and Sufficient Conditions for Existence and Uniqueness of Recursive Utilities","arxiv_id":"1710.06526","date":"2017-10-17","proceeding":null,"authors":["Jaroslav Borovicka","John Stachurski"],"abstract":"We study existence, uniqueness and computability of solutions for a class of\ndiscrete time recursive utilities models. By combining two streams of the\nrecent literature on recursive preferences---one that analyzes principal\neigenvalues of valuation operators and another that exploits the theory of\nmonotone concave operators---we obtain conditions that are both necessary and\nsufficient for existence and uniqueness of solutions. We also show that the\nnatural iterative algorithm is convergent if and only if a solution exists.\nConsumption processes are allowed to be nonstationary.","url_abs":"http://arxiv.org/abs/1710.06526v3","url_pdf":"http://arxiv.org/pdf/1710.06526v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"necessary-and-sufficient-conditions-for-1","repo_url":"https://github.com/jstac/recursive_utility_code","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}