1995-10-04 - The Evolution of Cooperation (Towards a mathematical theory of reputation?)

Header Data

From: norm@netcom.com (Norman Hardy)
To: cypherpunks@toad.com
Message Hash: 6579ae2bdca485cf240d11919dccbc3e285feb1c22a833f81bdfa1496b458443
Message ID: <ac97b7d503021004c5f9@DialupEudora>
Reply To: N/A
UTC Datetime: 1995-10-04 04:00:14 UTC
Raw Date: Tue, 3 Oct 95 21:00:14 PDT

Raw message

From: norm@netcom.com (Norman Hardy)
Date: Tue, 3 Oct 95 21:00:14 PDT
To: cypherpunks@toad.com
Subject: The Evolution of  Cooperation (Towards a mathematical theory of reputation?)
Message-ID: <ac97b7d503021004c5f9@DialupEudora>
MIME-Version: 1.0
Content-Type: text/plain


I highly recommend Axelrod's short book, The Evolution of  Cooperation, for
those (like me) who find it hard to think clearly about trust issues. You
have probably heard about prisoner's dilemma, tit-for-tat etc. Axelrod is a
very early worker in this field. He set up a tournament of programmed bugs
that competed with each other in an artificial environment. They could
survive only by cooperation with other bugs. The could also cheat.

Axelrod does not use the term "reputation" but it what one bug gains or
looses as it interacts with other bugs in iterated encounters.

I read the book about two years ago. Only last night did I realize that
those ideas helped me think about the MITM threat.







Thread