Algorithm 1 Agent logic to determine an answer to a proposition query

Input: Information about other agents (proposals, group organization)   Output: Proposal determined via the algorithm—unchanged or adapted range   1:function determineAnswer(peerInfo[])   2:                          ▹ Compare range overlapping   3:     $\mathrm{lowestOverlapAgents}\left[\right]\leftarrow \mathrm{findLowestOverlap}\left(\mathrm{peerInfo}\left[\right]\right)$   4:     if $\mathrm{lowestOverlapAgents}\left[\right].\mathrm{containsOnly}(\mathrm{thisAgent}$) then   5:        return newRangeCalculation()               ▹ Agent concedes   6:     end if   7:                             ▹ Compare flexibility rank   8:     $\mathrm{higherFFactorAgent}\leftarrow \mathrm{thisAgent}$   9:     $\mathrm{sameGroupAgents}\left[\right]\leftarrow \left[\right]$ 10:   for  agentOther in lowestOverlapAgents[] do 11:        if $\mathrm{agentOther}.\mathrm{group}>\mathrm{thisAgent}.\mathrm{group}$ then 12:           return currentProposal            ▹ Agent does not concede 13:        else if $\mathrm{agentOther}.\mathrm{group}=\mathrm{thisAgent}.\mathrm{group}$ then 14:           $\mathrm{sameGroupAgents}.\mathrm{append}\left(\mathrm{agentOther}\right)$ 15:        end if 16:   end for 17:   if $\mathrm{higherFFactorAgent}=\mathrm{thisAgent}$ and $\mathrm{sameGroupAgents}.\mathrm{size}\left(\right)=0$ then 18:        return newRangeCalculation()             ▹ Agent concedes 19:   end if 20:                  ▹ Compare distance to next achievable overlap 21:   $\mathrm{mostDistanceAgent}\leftarrow \mathrm{thisAgent}$ 22:   $\mathrm{tieAgents}\left[\right]\leftarrow \left[\right]$ 23:   for  agentOther in sameGroupAgents[] do 24:        $\mathrm{distanceComparison}\leftarrow \mathrm{compareDistanceSum}(\mathrm{thisAgent},\mathrm{agentOther})$ 25:        if $\mathrm{distanceComparison}=1$ then 26:           $\mathrm{mostDistanceAgent}\leftarrow \mathrm{agentOther}$ 27:           return currentProposal            ▹ Agent does not concede 28:        else if $\mathrm{distanceComparison}=0$ then 29:           $\mathrm{tieAgents}.\mathrm{append}\left(\mathrm{agentOther}\right)$ 30:        end if 31:   end for 32:   if $\mathrm{len}\left(\mathrm{tieAgents}\right)=0$ and $\mathrm{mostDistanceAgent}=\mathrm{thisAgent}$ then 33:        return newRangeCalculation()             ▹ Agent concedes 34:   end if 35:        ▹ Tie scenario (often in a 1 on 1 situation): compare concession count 36:   for agentOther in tieAgents[] do 37:        if $\mathrm{thisAgent}.\mathrm{roundConcessions}>\mathrm{agentOther}.\mathrm{roundConcessions}$ then 38:           return currentProposal            ▹ Agent does not concede 39:        end if 40:   end for 41:   return currentProposal              ▹ Agent does not concede 42:end function