On the communication complexity of approximate fixed points

DOI10.1109/FOCS.2016.32MaRDI QIDQ6946477zbMATH OpenFDO

Authors O. Weinstein, Tim Roughgarden

Publication date 6 August 2025

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)

Cited in

(1)

• Envy-free cake-cutting for four agents

This page was built for publication: On the communication complexity of approximate fixed points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946477)