Verification of multiprocess probabilistic protocols
Distributed Computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Additional comments on a problem in concurrent programming control
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A synchronization algorithm for distributed systems
CSC '91 Proceedings of the 19th annual conference on Computer Science
| Hi-index | 0.00 |
Consideration is given to a system of n competitors, where if a competitor selects its bids equally likely from a given set of bid values, its probability of winning is guaranteed to be 1/n, regardless of the bid values selected by other competitors in the system. A discussion is presented of several variations of this basic scheme, namely, bidding with unequal weights, bidding with more than one winner, and bidding with an unknown number of competitors. Two economical, but approximate, bidding schemes are discussed. In the first scheme, the competitors select their bids from a set with a constant size, and in the second, each competitor selects only one bid even though the total number of competitors is not known a priori. It is shown how to use these bidding schemes to construct solutions to several problems in distributed systems, including the mutual exclusion problem and the dining philosophers problem.