home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!olivea!gossip.pyramid.com!pyramid!infmx!news
- From: robertw@informix.com (Robert Weinberg)
- Newsgroups: rec.puzzles
- Subject: Re: "Cut & Choose" for several players
- Message-ID: <1993Jan22.205706.27776@informix.com>
- Date: 22 Jan 93 20:57:06 GMT
- References: <43725@sdcc12.ucsd.edu>
- Sender: news@informix.com (Usenet News)
- Organization: Informix Software, Inc.
- Lines: 30
-
- In article <43725@sdcc12.ucsd.edu> cs161fir@sdcc10.ucsd.edu (Anthony Minkoff)
- writes:
- >
- > Now I want a method for distributing the pile among n players, so
- > that no player feels that any other player received a better
- > portion.
- >
- I'm following up to rec.puzzles, rather than sci.math, because my solution is not
- mathematical.
-
- In a real social situation, I suppose you could do this:
-
- Player 1 of n (decided perhaps by lot) must divide up the entire lot into n
- bundles. Every player, including player 1, agrees to take any one of these bundles
- unless he wishes to challenge the division, in which case he must re-divide the
- entire lot himself. The kinds of division resulting from each challenge might be
- radically different, reflecting the different values of the players.
-
- Any number of challengers may redivide the lot until no further challenges are
- offered - after which each must take any one of the bundles (chosen randomly or in
- some ordered fashion). The person making the final challenge does not suffer the
- penalty of taking the last remaining bundle, since any other player could have
- redivided the lot.
-
- --
- +================================+================================+
- | Rob Weinberg | Workstation publications tech |
- | Email : robertw@informix.com | Graphic designer |
- | Voice : 415-926-6754 | <imagine your ad here> |
- +================================+================================+
-