{"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/note-on-solving-one-to-one-matching-models","title":"Note on solving one-to-one matching models with linear transferable utility","arxiv_id":"2409.05518","date":"2024-09-09","proceeding":null,"authors":["Esben Scrivers Andersen"],"abstract":"We derive a system of fixed-point equations for the equilibrium transfers in a class of one-to-one matching models with linear transferable utility. We then show that, when the degree of substitution between alternatives is bounded from above, the derived system of equations constitutes a contraction mapping. As a result, fixed-point iterations are guaranteed to converge to the unique distribution of equilibrium transfers.","url_abs":"https://arxiv.org/abs/2409.05518v2","url_pdf":"https://arxiv.org/pdf/2409.05518v2.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":"note-on-solving-one-to-one-matching-models","repo_url":"https://github.com/esbenscriver/SolveOneToOneMatching","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"jax","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}