Asymmetric structure between two sets of adaptive agents: an approach using a matching automaton

Authors:
Yoshiteru Ishida;Kazuma Sasaki
Affiliations:
Department of Computer Science and Engineering, Toyohashi University of Technology, Toyohashi, Japan;Department of Computer Science and Engineering, Toyohashi University of Technology, Toyohashi, Japan
Venue:
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part IV
Year:
2011

Citing 5
Cited 1

Selective networks and recognition automata

Proc. of a symposium on Computer culture: the scientific, intellectual, and social impact of the computer
The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
How do I marry thee? Let me count the ways

Discrete Applied Mathematics
Immunity-Based Systems

Immunity-Based Systems
Asymmetric Phenomena of Segregation and Integration in Biological Systems: A Matching Automaton

KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II

Mapping problems to dynamical systems for robustness and adaptability: the case of matching problems

Proceedings of the International Conference on Management of Emergent Digital EcoSystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using a matching automaton motivated by the Stable Marriage Problem (SMP), we discuss an adaptive behavior observed in audio sensory systems. The matching automaton with two disjoint sets of adaptive agents will adapt to the environment by using a degree of freedom in the automata. Further, we also discuss an asymmetry between the environment side and cognitive side which plays a critical role. When the diversity in the environment is lowered, the cognitive side is induced to adapt to the environment by reorganizing resources that were assigned to less important functions.