Skip to main content
. 2019 Dec 6;19(24):5393. doi: 10.3390/s19245393
Algorithm 1 CA algorithm for each player i
Input:δi, ui, ai,n, ui,n, Np, Nc
 1: Assampleactions(δi,ui,ai,p,ui,p,Np,Nc)
 2: if As= then
 3:  As=ai,p
 4: else
 5:  while|As|>1 do
 6:   Asparetoprune(As,ui)
Output: As