Matching Automata and the Self-repairing Network
摘要
The attainment of self-rewiring among agents by another self-action model, namely self-repair networks, is discussed. Among self-action models, self-repairing networks allow state changes of nodes by action (repair). Self-repairing networks are extended to allow network changes by action (rewire). The self-rewiring algorithm is also extended from the self-repairing algorithm. The extended algorithm can be applied to several problems, such as the stable marriage problem and the distance adjustment problem of collective agents. Comparison between node repair and link rewire is performed, and further extensions are discussed.