549 search results - page 1 / 110 » Rationality in the Full-Information Model |
TCC
2010
Springer
14 years 3 months ago
2010
Springer
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
SIAMCOMP
1998
13 years 6 months ago
1998
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
ICDCN
2011
Springer
12 years 10 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we use random-selection protocols in the full-information model to solve classical problems in distributed computing. Our main results are the following: • An O(l...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...