Yun Kuen CHEUNG (Marco) 張潤權
Email: [AT] cims [DOT] nyu [DOT] edu



Postdoctoral researcher in the research group Theory and Applications of Algorithms (TAA), University of Vienna
PhD at Courant Institute of Mathematical Sciences, New York University; Department: Computer Science
MPhil at HKUST; Department: Mathematics (worked in Theoretical Computer Science Lab)
BSc at HKUST; Major: Mathematics, Physics; Minor: Information and Technology (almost equivalent to Computer Science)

Main Page

4 September, 2014: I am about to join as a postdoctoral researcher in the research group Theory and Applications of Algorithms (TAA) in University of Vienna (U Wien), led by Prof. Monika Henzinger. This page will be synchronized with my U Wien webpage (to be built soon).

6 June, 2014: I have successfully defensed my thesis.

I am a PhD graduated from the Computer Science Department, Courant Institute of Mathematical Sciences, New York University. I was fortunate to have Prof. Richard Cole as my advisor during 2009-2014, and then head to the beautiful and efficient city of Vienna to work with Prof. Monika Henzinger in TAA in University of Vienna (U Wien).

My research interest is broadly in theoretical computer science, algorithm design and analysis. I am focusing primarily on computational economics and algorithmic game theory, with emphasis on problems about market/game dynamics and mechanism design.

My current research focuses on market equilibrium computation problems; one of our aims is to explain why equilibria are often reached (approximately) in real world from an algorithmic perspective. We study a distributed price-udpate dynamic called tatonnement. In the work with Richard Cole and Nikhil Devanur, we show that in any Fisher market with buyers having CES utility functions, tatonnement is equivalent to gradient descent on some convex potential function, so as to show that tatonnement attains quick convergence toward the market equilibrium. Beyond the standard continuous and discrete synchronous tatonnements, we have been working on asynchronous tatonnement too; the analysis can be extended to asynchronous gradient descent.

When I did my MPhil in Hong Kong University of Science and Technology, I was fortunate to have Prof. Mordecai Golin as advisor. We used Mellin transform technique to solve some divide-and-conquer type recurrences exactly, which give exact formula on varies types of weighted digital sums that appear in different algorithm analysis problems. Prof. Philippe Flajolet told me in a private communication that the technique can become a standard analytical approach for comparing practical algorithms, e.g. sorting and searching. I welcome input from researchers working on developing practical algorithms.

For more details of my research and publications, click here.