Love First, Know Later: Persona-Based Romantic Compatibility Through LLM Text World Engines
Haoyang Shang, Zhengyang Yan, Xuan Liu

TL;DR
This paper introduces a novel compatibility assessment framework using LLMs as text world engines to simulate interactions and predict human preferences, shifting from static profile comparison to dynamic relationship modeling.
Contribution
It presents a new paradigm leveraging LLMs for interaction simulation and compatibility prediction, with formal proofs and empirical validation on dating data.
Findings
LLM-based simulations improve compatibility predictions
Theoretical proof of convergence to stable matching
Empirical validation on speed dating and divorce data
Abstract
We propose Love First, Know Later: a paradigm shift in computational matching that simulates interactions first, then assesses compatibility. Instead of comparing static profiles, our framework leverages LLMs as text world engines that operate in dual capacity-as persona-driven agents following behavioral policies and as the environment modeling interaction dynamics. We formalize compatibility assessment as a reward-modeling problem: given observed matching outcomes, we learn to extract signals from simulations that predict human preferences. Our key insight is that relationships hinge on responses to critical moments-we translate this observation from relationship psychology into mathematical hypotheses, enabling effective simulation. Theoretically, we prove that as LLM policies better approximate human behavior, the induced matching converges to optimal stable matching. Empirically,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPersona Design and Applications · Artificial Intelligence in Law · Attachment and Relationship Dynamics
