Comparative Agent-based Simulations on Levels of Multiplicity Using a Network Regression: A Mobile Dating Use-case

We report an agent-based model to compare the effectiveness of simple and complex mobile dating application interfaces in generating matches for virtual users. We define the relative complexity of dating applications as the number of available features and dub this variable, the multiplicity. We replicate some of the most popular mobile dating applications through the generation of a synthetic population endowed with attributes, preferences, and behaviors drawn from literature. We treat our data as a network dataset and use a robust statistical procedure (MRQAP) to issue a valid and reliable comparison between simulated applications. We show how the quadratic assignment procedure can be used to compare network simulations rigorously. As a result, we observe a direct relationship between multiplicity and agent-level experiences and expectations in match generation. We also observe the emergence of divergent matching systems with minor rule changes as well as several expected properties of online dating systems. This work serves as a proof-of-concept in the integration of classical social network analysis methods with agent-based modeling to compare virtual designs and to enhance the policy-generation process of online social networks.