https://arxiv.org/abs/cs/0406061 is a result showing tht Aumann’s Agreement is computationally efficient under some assumptions, which might be of interest.
I don’t really buy that paper, IIRC it says that you only need to change a polynomial number of messages, but that each message takes exponential time to produce, which doesn’t sound very efficient.
From the abstract: The time used by the procedure to achieve agreement within epsilon is on the order of O(e^(epsilon ^ −6))… In other words, yeah, the procedure is not cheap
https://arxiv.org/abs/cs/0406061 is a result showing tht Aumann’s Agreement is computationally efficient under some assumptions, which might be of interest.
I don’t really buy that paper, IIRC it says that you only need to change a polynomial number of messages, but that each message takes exponential time to produce, which doesn’t sound very efficient.
From the abstract: The time used by the procedure to achieve agreement within epsilon is on the order of O(e^(epsilon ^ −6))… In other words, yeah, the procedure is not cheap