1996-07-26 - Re: Twenty Bank Robbers – Game theory:)

Header Data

From: Hal <hfinney@shell.portal.com>
To: cypherpunks@toad.com
Message Hash: 99ef0a65729385d6ba7d34e7d36e863995188df6847afde0eca3dff42aa1f92f
Message ID: <199607252305.QAA06996@jobe.shell.portal.com>
Reply To: N/A
UTC Datetime: 1996-07-26 01:45:06 UTC
Raw Date: Fri, 26 Jul 1996 09:45:06 +0800

Raw message

From: Hal <hfinney@shell.portal.com>
Date: Fri, 26 Jul 1996 09:45:06 +0800
To: cypherpunks@toad.com
Subject: Re: Twenty Bank Robbers -- Game theory:)
Message-ID: <199607252305.QAA06996@jobe.shell.portal.com>
MIME-Version: 1.0
Content-Type: text/plain


I think the best way to approach this problem is to first try to solve
it assuming there are only two robbers rather than 20.  Then once you
have that figured out, try it for three, then four, and so on.  Keep in
mind that 50% support is enough for a proposed distribution to pass, you
don't need a strict majority.

Hal

Thread

• Return to July 1996

• Return to “David Sternlight <david@sternlight.com>”
• Return to “Hal <hfinney@shell.portal.com>”

• Return to “ichudov@algebra.com (Igor Chudov @ home)”

• 1996-07-26 (Fri, 26 Jul 1996 09:45:06 +0800) - Re: Twenty Bank Robbers – Game theory:) - Hal <hfinney@shell.portal.com>
  • 1996-07-26 (Fri, 26 Jul 1996 18:28:37 +0800) - Re: Twenty Bank Robbers – Game theory:) - David Sternlight <david@sternlight.com>
    • 1996-07-26 (Sat, 27 Jul 1996 01:03:18 +0800) - Re: Twenty Bank Robbers – Game theory:) - ichudov@algebra.com (Igor Chudov @ home)