Tools
Tools
Sigmund, K. (2004). Three's company when seeking unanimity. Proceedings of the National Academy of Sciences 101 (52) 17885-17886. 10.1073/pnas.0407824101.
Preview |
Text
Three's company when seeking unanimity.pdf - Published Version Available under License Creative Commons Attribution Non-commercial. 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: | 27 Aug 2021 17:37 |
| URI: | https://pure.iiasa.ac.at/7136 |
Actions (login required)
 |
View Item |