This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all loyal generals agree on a good plan proposed by a loyal general, and never on a bad plan. © 2008 Elsevier Inc. All rights reserved.
ASJC Scopus subject areas
- Artificial Intelligence
- Hardware and Architecture
- Theoretical Computer Science
- Computer Networks and Communications