207 search results - page 2 / 42 » The complexity of agreement |
STOC
2005
ACM
14 years 5 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
STACS
1995
Springer
13 years 8 months ago
1995
Springer
CORR
2010
Springer
13 years 2 months ago
2010
Springer
INFORMATICALT
2006
13 years 5 months ago
2006
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...