From: ichudov@algebra.com (Igor Chudov @ home)
Date: Sat, 27 Jul 1996 01:03:18 +0800
To: david@sternlight.com (David Sternlight)
Subject: Re: Twenty Bank Robbers -- Game theory:)
In-Reply-To: <v03007801ae1e1cb77f7f@[192.187.162.15]>
Message-ID: <199607261353.IAA03025@manifold.algebra.com>
MIME-Version: 1.0
Content-Type: text


David Sternlight wrote:
> 
> At 4:05 PM -0700 7/25/96, Hal wrote:
> >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.
> >
> 
> Exactly. I arrived at the solution the same way. Note that there is another
> assumption needed--that the selection of a proposer is by lot at each new
> stage. If the ordering of proposers is known in advance, a different
> solution results.

Yes, the cypherpunk robbers are ordered by alphabet.

igor