In the robust secure aggregation problem, a server wishes to learn and only sum of inputs number users while some may drop out (i.e., not respond). The identity dropped is known priori needs securely recover remaining surviving users. We consider following minimal two-round model aggregation. Over first round, any set no fewer than <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" ...

With dispersed information, how much can agents learn from past endogenous aggregates such as prices or output? In a rational-expectations equilibrium, if general equilibrium effects are strong enough, no longer perfectly reveal underlying fundamentals. this confounding regime, the of informational frictions persistent over time, and aggregate outcome displays an initial under-reaction followed...