English

The Byzantine Brides Problem

Distributed, Parallel, and Cluster Computing 2012-03-19 v1

Abstract

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.

Cite

@article{arxiv.1203.3575,
  title  = {The Byzantine Brides Problem},
  author = {Swan Dubois and Sébastien Tixeuil and Nini Zhu},
  journal= {arXiv preprint arXiv:1203.3575},
  year   = {2012}
}
R2 v1 2026-06-21T20:34:56.267Z