The stable marriage problem: structure and algorithms
The stable marriage problem: structure and algorithms
Self-Organizing Maps
Stable Marriage with Incomplete Lists and Ties
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Human Problem Solving
A network visualization of stable matching in the stable marriage problem
Artificial Life and Robotics
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part IV
Asymmetric structure between two sets of adaptive agents: an approach using a matching automaton
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part IV
A critical phenomenon in a self-repair network by mutual copying
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
A diagrammatic classification in a combinatorial problem: the case of the stable marriage problem
Artificial Life and Robotics
Hi-index | 0.00 |
Important problems can be solved by mapping them to dynamical systems, which also confers several advantages such as robustness to model assumptions and clarification of stability and adaptability, which may not be obtained by conventional algorithmic solutions. This paper proposes a mapping framework focusing on bipartite matching problems, and discusses applications to support recovery economics.