Researcher Portfolio
Cheung, Yun Kuen
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher Profile
Position: Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher ID: https://pure.mpg.de/cone/persons/resource/persons202384
Publications
: Ray Chaudhury, B., Cheung, Y. K., Garg, J., Garg, N., Hoefer, M., & Mehlhorn, K. (2022). Fair Division of Indivisible Goods for a Class of Concave Valuations. Journal of Artificial Intelligence Research, 74, 111-142. doi:10.1613/jair.1.12911. [PubMan] : Cheung, Y. K., Hoefer, M., & Nakhe, P. (2019). Tracing Equilibrium in Dynamic Markets via Distributed Adaptation. In AAMAS '19 (pp. 1225-1233). New York, NY: ACM. [PubMan] : Cheung, Y. K. (2018). Steiner Point Removal - Distant Terminals Don't (Really) Bother. In A. Czumaj (Ed. ), Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1353-1360). Philadelphia, PA: SIAM. doi:10.1137/1.9781611975031.89. [PubMan] : Cheung, Y. K., Cole, R., & Tao, Y. (2018). Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism. Retrieved from http://arxiv.org/abs/1811.05087. [PubMan] : Cheung, Y. K., Cole, R., & Tao, Y. (2018). Dynamics of Distributed Updating in Fisher Markets. In ACM EC'18 (pp. 351-368). New York, NY: ACM. doi:10.1145/3219166.3219189. [PubMan] : Cheung, Y. K., Hoefer, M., & Nakhe, P. (2018). Tracing Equilibrium in Dynamic Markets via Distributed Adaptation. Retrieved from http://arxiv.org/abs/1804.08017. [PubMan] : Ray Chaudhury, B., Cheung, Y. K., Garg, J., Garg, N., Hoefer, M., & Mehlhorn, K. (2018). On Fair Division for Indivisible Items. In S. Ganguly, & P. Pandya (Eds. ), 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (pp. 1-17). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.FSTTCS.2018.25. [PubMan] : Cheung, Y. K., & Cole, R. (2018). Amortized Analysis of Asynchronous Price Dynamics. In Y. Azar, H. Bast, & G. Herman (Eds. ), 26th Annual European Symposium on Algorithms (pp. 1-15). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ESA.2018.18. [PubMan] : Ray Chaudhury, B., Cheung, Y. K., Garg, J., Garg, N., Hoefer, M., & Mehlhorn, K. (2018). On Fair Division of Indivisible Items. Retrieved from http://arxiv.org/abs/1805.06232. [PubMan] : Chandran, L. S., Cheung, Y. K., & Issac, D. (2018). Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds. ), 45th International Colloquium on Automata, Languages, and Programming (pp. 1-14). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2018.32. [PubMan] : Cheung, Y. K. (2018). Multiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games. In S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, & R. Garnett (Eds. ), Advances in Neural Information Processing Systems 31 (pp. 3532-3542). Curran Associates. [PubMan] : Cheung, Y. K., Cole, R., & Tao, Y. (2018). (Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup. Retrieved from http://arxiv.org/abs/1811.03254. [PubMan] : Cheung, Y. K., & Cole, R. (2016). A Unified Approach to Analyzing Asynchronous Coordinate Descent and Tatonnement. Retrieved from http://arxiv.org/abs/1612.09171. [PubMan]