Author of the publication

Information Complexity Is Computable.

, and . ICALP, volume 55 of LIPIcs, page 87:1-87:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Tight space-noise tradeoffs in computing the ergodic measure., , and . CoRR, (2015)Information Complexity Is Computable., and . ICALP, volume 55 of LIPIcs, page 87:1-87:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Contracts under Moral Hazard and Adverse Selection., , and . EC, page 563-582. ACM, (2021)Strategizing against Learners in Bayesian Games., , , and . COLT, volume 178 of Proceedings of Machine Learning Research, page 5221-5252. PMLR, (2022)Prior-Free Dynamic Auctions with Low Regret Buyers., , and . NeurIPS, page 4804-4814. (2019)Myersonian Regression., , and . NeurIPS, (2020)Contextual Search via Intrinsic Volumes., and . FOCS, page 268-282. IEEE Computer Society, (2018)Dynamical Analysis of Autobidding Systems., , , , and . CoRR, (2024)Costly Zero Order Oracles., and . COLT, volume 125 of Proceedings of Machine Learning Research, page 3120-3132. PMLR, (2020)Condorcet-Consistent and Approximately Strategyproof Tournament Rules., , and . ITCS, volume 67 of LIPIcs, page 35:1-35:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)