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

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 equal to Computer Science)

Main Page

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

I am a fifth year PhD candidate in Computer Science Department, Courant Institute of Mathematical Sciences, New York University. I am fortunate to have Prof. Richard Cole as my advisor. 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 recent work with Richard Cole and Nikhil Devanur, we show that for Fisher markets with CES utility functions, tatonnement is equivalent to gradient descent on some convex potential function. We show that the potential function satisfies 'strong sandwiching property', which is a generalization of strong convexity (on standard metric) to Bregman divergence (an asymmetric metric), so as to show that tatonnement attains quick convergence toward market equilibrium. Beyond the standard continuous and discrete synchronous tatonnements, we are working on asynchronous tatonnement too.

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.