Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2012-03-15
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
We investigate the hardness of establishing as many stable marriages (that is, marriages that last forever) in a population whose memory is placed in some arbitrary state with respect to the considered problem, and where traitors try to jeopardize the whole process by behaving in a harmful manner. On the negative side, we demonstrate that no solution that is completely insensitive to traitors can exist, and we propose a protocol for the problem that is optimal with respect to the traitor containment radius.
Dubois Swan
Tixeuil Sébastien
Zhu Nini
No associations
LandOfFree
The Byzantine Brides Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Byzantine Brides Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Byzantine Brides Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-348124