Agreeing to agree with uncountable information structures

► We study agreeing to agree in uncountable-information models. ► Lehrer and Samet (2011) provide a full characterization in countable models. ► We show the characterization cannot be extended to uncountable-information models. ► This answers an open question raised in Lehrer and Samet (2011).