Autonomous Mechanism for Partner Exchanging in Distributed Stable Marriage Problems
Summary :
The stable marriage problem is one of the basic problems proposed in 1962. In this paper, we consider a distributed stable marriage problem. This problem is applicable to cooperative works of autonomous robots in distributed environments. We show a Gale-Shapley based protocol to obtain stable matching and introduce autonomous mechanism for exchanging partners, called divorce process, in distributed environments. We report some interesting results of matching games by computer simulation.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.6 pp.1040-1048
- Publication Date
- 1997/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section of Papers Selected from 1996 International Technical Conference on Circuits/Systems, Computers and Communications(ITC-CSCC'96))
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hideki KINJO, Morikazu NAKAMURA, Kenji ONAGA, "Autonomous Mechanism for Partner Exchanging in Distributed Stable Marriage Problems" in IEICE TRANSACTIONS on Fundamentals,
vol. E80-A, no. 6, pp. 1040-1048, June 1997, doi: .
Abstract: The stable marriage problem is one of the basic problems proposed in 1962. In this paper, we consider a distributed stable marriage problem. This problem is applicable to cooperative works of autonomous robots in distributed environments. We show a Gale-Shapley based protocol to obtain stable matching and introduce autonomous mechanism for exchanging partners, called divorce process, in distributed environments. We report some interesting results of matching games by computer simulation.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_6_1040/_p
Copy
@ARTICLE{e80-a_6_1040,
author={Hideki KINJO, Morikazu NAKAMURA, Kenji ONAGA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Autonomous Mechanism for Partner Exchanging in Distributed Stable Marriage Problems},
year={1997},
volume={E80-A},
number={6},
pages={1040-1048},
abstract={The stable marriage problem is one of the basic problems proposed in 1962. In this paper, we consider a distributed stable marriage problem. This problem is applicable to cooperative works of autonomous robots in distributed environments. We show a Gale-Shapley based protocol to obtain stable matching and introduce autonomous mechanism for exchanging partners, called divorce process, in distributed environments. We report some interesting results of matching games by computer simulation.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Autonomous Mechanism for Partner Exchanging in Distributed Stable Marriage Problems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1040
EP - 1048
AU - Hideki KINJO
AU - Morikazu NAKAMURA
AU - Kenji ONAGA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 1997
AB - The stable marriage problem is one of the basic problems proposed in 1962. In this paper, we consider a distributed stable marriage problem. This problem is applicable to cooperative works of autonomous robots in distributed environments. We show a Gale-Shapley based protocol to obtain stable matching and introduce autonomous mechanism for exchanging partners, called divorce process, in distributed environments. We report some interesting results of matching games by computer simulation.
ER -
English
