Making an Agreement in an Order-Heterogeneous Group

  • Authors:

  • Ailixier Aikebaier;Tomoya Enokido;Makoto Takizawa

  • Affiliations:

  • Tokyo Denki University, Japan;Rissho University, Japan;Seikei University, Japan

  • Venue:
  • NBiS '08 Proceedings of the 2nd international conference on Network-Based Information Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In traditional agreement protocols of multiple peer processes (peers), every peer just aims at agreeing on one value out of values shown by the peers. In meetings of human societies, agreement procedures are so flexible that persons can change their opinions and can use various types of agreement conditions. We already discuss E- and P-precedent relations v1$\rightarrow_i^E$ v2and v1$\rightarrow_i^P$ v2on values v1and v2of a peer pi, which show that pican take v2after taking v1and prefers v1to v2, respectively. If a peer autonomously takes values only based on its precedent relations, the peers might not make an agreement even if the values satisfy the agreement condition. We discuss what previous values the peer can take again an order-heterogenous system where some pair of peers have different precedent relations. In this paper, we discuss a cut, i.e. a satisfiable set of previous values in a history of values which the peers have so far taken, in addition for each peer to taking a new value at each round.