An M-party, N-state Game of Rochambeau
draft-harkins-rochambeau-02
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Authors | Dan Harkins , Paul Lambert | ||
| Last updated | 2013-10-03 (Latest revision 2013-04-01) | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
plain text
htmlized
pdfized
bibtex
|
||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of
the expired Internet-Draft can be found at:
https://www.ietf.org/archive/id/draft-harkins-rochambeau-02.txt
https://www.ietf.org/archive/id/draft-harkins-rochambeau-02.txt
Abstract
A protocol for the fair selection and random distribution of a single winner in a game with an arbitrary number of players is described.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)