The complexity of agreement
From MaRDI portal
Publication:3581454
DOI10.1145/1060590.1060686zbMath1192.91030OpenAlexW1980028563MaRDI QIDQ3581454
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060686
Bayesian problems; characterization of Bayes procedures (62C10) Logics of knowledge and belief (including belief change) (03B42) Rationality and learning in game theory (91A26)
Related Items (5)
The communication complexity of functions with large outputs ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ The Riemann hypothesis in computer science ⋮ Bayesian Decision Making in Groups is Hard ⋮ Resource bounded symmetry of information revisited
This page was built for publication: The complexity of agreement
