Presentation 2000/1/18
2-Concurrent Matching Reconstruction for Distributed Stable Marriage Problem
Hideki Kinjo, Morikazu Nakamura, Kenji Onaga,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In our previous works, an autonomous partner exchange mechanism was proposed for the distributed stable marriage problem in which we assumed no member can initiate a partner exchange process if another process is running, that is the process is mutually excluded. In this paper, we extend case to the two concurrent version where even if there is a running process, at most one member can initiate another. We show in this paper the sufficient and necessary condition such that two concurrent processes can lead to another stable matching independently of the timing of process interaction.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Distributed Stable Marriage Problem / Matching Reconstruction / 2-concurrent Processes / Interaction
Paper # CST99-65
Date of Issue

Conference Information
Committee CST
Conference Date 2000/1/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Concurrent System Technology (CST)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) 2-Concurrent Matching Reconstruction for Distributed Stable Marriage Problem
Sub Title (in English)
Keyword(1) Distributed Stable Marriage Problem
Keyword(2) Matching Reconstruction
Keyword(3) 2-concurrent Processes
Keyword(4) Interaction
1st Author's Name Hideki Kinjo
1st Author's Affiliation Dept.of Information Eng., Univ.of the Ryukyus()
2nd Author's Name Morikazu Nakamura
2nd Author's Affiliation Dept.of Information Eng., Univ.of the Ryukyus
3rd Author's Name Kenji Onaga
3rd Author's Affiliation Dept.of Information Eng., Univ.of the Ryukyus
Date 2000/1/18
Paper # CST99-65
Volume (vol) vol.99
Number (no) 539
Page pp.pp.-
#Pages 8
Date of Issue