Ye Du

 

PhD candidate, EECS, The University of Michigan
M.S.E.  in Computer Science & Engineering, The University of Michigan, 2006
B.E. in Computer Science and Technology, University of Science and Technology of China, 2004

 

Research Interests

 

I have broad interests in theoretical computer science and applied mathematics, such as graph theory, stochastic process (especially Markov chain), algorithm design and analysis. Currently I am working in the intersection fields of theoretical computer science, game theory, and ECONOMICS.

 

I especially appreciate HIS ideas and philosophy about research and public affairs.

 

Contacts

Postal: 2260 Hayward Ave, Ann Arbor, MI 48109-2121
Office: 3944 CSE
Phone: 734-763-1909
Email:duye@umich.edu

 

Research Papers

 

On the Complexity of Deciding Degeneracy in Games

 

Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities, with Xi Chen, Decheng Dai and Shanghua Teng

 

PerturbationRank: A Non-monotone Ranking Algorithm, with James Leung and Yaoyun Shi

 

The Computation of Approximate Competitive Equilibrium is PPAD-hard, with Xiaotie Deng, Inf. Process. Lett. 108(6): 369-373 (2008)& Invited Talk in INFORMS 2008 .

 

On the Complexity of Deciding Bimatrix Games Similarity, Theor. Comput. Sci. 407(1-3): 583-586 (2008).

 

Using Spam Farm to Boost PageRank, with Yaoyun Shi and Xin Zhao, Proceedings of Third International Workshop on Adversarial Information Retrieval on the Web (AIRWeb07), 2007.

 

Path Auction Games When an Agent Can Own Multiple Edges, with Rahul Sami and Yaoyun Shi, Proceedings of First Workshop on the Economics of Networked Systems(NetEcon06), 2006. Journal version under submission to Theor. Comput. Sci.

 

Multiplicative Monotone Property of Semisymmetric Markov Chain with Yaoyun Shi

 

A New Upper Bound On Forwarding Index of Graphs, with Junming Xu, Tao Zhou and Jun Yan, Ars Combinatoria, 83 (2007), 289-293.