Dresden 2017 – scientific programme

Parts | Days | Selection | Search | Updates | Downloads | Help

SOE: Fachverband Physik sozio-ökonomischer Systeme

SOE 16: Networks (joint session SOE / DY / BP)

SOE 16.10: Talk

Thursday, March 23, 2017, 12:15–12:30, GÖR 226

Timescale of reaching stable state with relation to different ranking strategies in the stable marriage problem. — •Piotr Nyczka — Jacobs University Bremen, Germany

Stable marriage problem is wery well known topic. However there is still plenty of room for further investigation. In my presentation I will discuss process of reaching the stable state in the system consisting of two different types of agents.

Agents from two sets (eg. men and women) undergo random encounters and then decide whether they want to be together or not. They want to form a new couple only in the case where, as a result of this change, both of them will end up with "better" partner than actual one.

Each agent have its personal ranking list with "attraciveness" scores for potential partners of opposite sex and it's possible to make network out of these lists. In my presentation I will focus on relation between structure of this network, and timescale of process of reaching stable state. There is very strong and interesting relation between them, definitely worth of further investigation.