Ganor, Anat and Karthik, C. S. and Pálvölgyi, Dömötör (2021) On Communication Complexity of Fixed Point Computation. ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION, 9 (4). ISSN 2167-8375
|
Text
1909.10958.pdf Available under License Creative Commons Attribution. Download (666kB) | Preview |
Official URL: https://doi.org/10.1145/3485004
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | communication complexity; Sperner's Lemma; Nash equilibrium; Brouwer's fixed point theorem; |
| Subjects: | Q Science / természettudomány > Q1 Science (General) / természettudomány általában |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 12 Jun 2023 07:05 |
| Last Modified: | 12 Jun 2023 07:05 |
| URI: | http://real.mtak.hu/id/eprint/167133 |
Actions (login required)
 |
Edit Item |
