Three's company when seeking unanimity

Sigmund K (2004). Three's company when seeking unanimity. Proceedings of the National Academy of Sciences 101 (52): 17885-17886. DOI:10.1073/pnas.0407824101.

[img]
Preview
Text
Three's company when seeking unanimity.pdf - Published Version
Available under License Creative Commons Attribution.

Download (104kB) | Preview

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.

Item Type: Article
Research Programs: Adaptive Dynamics Network (ADN)
Bibliographic Reference: PNAS; 101(52):17885-17886 (28 December 2004) (Published online 20 December 2004)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 02:16
Last Modified: 23 Aug 2016 09:26
URI: http://pure.iiasa.ac.at/7136

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313