Compromise, consensus, and the iteration of means (Q1006437)

The paper studies discrete time dynamical systems that arise from what the author calls compromise dynamics. Several agents make proposals over time that lie in the convex hull of the previous round proposal. A typical example would be the artithmetic or geometric mean of the previous proposals. A compromise mapping is called proper if the convex hull of proposals shrinks over time. For such maps, the author shows the convergence of the corresponding compromise dynamics.