On the binomial decomposition of OWA functions, the 3-additive case in n dimensions

In the context of the binomial decomposition of OWA functions, we investigate the parametric constraints associated with the 3-additive case in n dimensions. The resulting feasible region in two coefficients is a convex polygon with n vertices and n edges, and is strictly increasing in the dimension n. The orness of the OWA functions within the feasible region is linear in the two coefficients, and the vertices associated with maximum and minimum orness are identified.