Read and access IIASA's models, tools, and data.

Research Projects

Read about individual research projects and activities at IIASA.

Research Partners

Read how IIASA works with research partners across the globe to deliver world-class research.

Models, Tools & Data

Read and access IIASA's models, tools, and data.

Three's company when seeking unanimity

Authors: Sigmund K

Publication Year: 2004

Reference: PNAS, 101(52):17885-17886 (28 December 2004) (Published online 20 December 2004)

. Commentary

Abstract

Random searches are routinely used in many algorithms, for instance, when looking for the shortest path connecting 100 cities or for ordering genomes in a most-parsimonious descendency tree. In this issue of PNAS, Matsen and Nowak use a random search for another type of problem, that of finding coherence rather than optimality. The task thus consists of reaching unanimity. The proposed solution is outrageously simple: Keep switching until you agree with two others, then stop. Under a wide set of conditions, this slapdash recipe works.