The Byzantine Brides Problem

Computer Science – Distributed – Parallel – and Cluster Computing

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-348124

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.