Ning Chen

Department of Computer Science & Engineering
Box 352350
University of Washington
Seattle, WA 98195-2350

(206) 543-7798
[firstname]@cs.washington.edu


I'm a graduate student of Computer Science & Engineering of the University of Washington. My advisor is Professor Anna Karlin.

My research interests include
  • Algorithmic Game Theory and Computational Economics
  • Algorithmic and Economic aspects of the Internet
  • Algorithms and Combinatorial Optimization
  • My photo portfolio


    Publications

    • Ning Chen, and Anna Karlin.
      Cheap Labor Can Be Expensive. (with a correction of a bug in the SODA version)
      • Conference version: ACM-SIAM Symposium on Discrete Algorithms (SODA), 707-715, 2007.
    • Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, and Maxim Sviridenko.
      Dynamic Pricing for Impatient Bidders.
      • Conference version: ACM-SIAM Symposium on Discrete Algorithms (SODA), 726-735, 2007.
      • Journal version: To appear in ACM Transactions on Algorithms.
    • David Abraham, Ning Chen, Vijay Kumar, and Vahab Mirrokni.
      Assignment Problems in Rental Market.
      • Conference version: International Workshop on Internet and Network Economics (WINE), LNCS 4286, 198-213, 2006.
    • Ning Chen, and Atri Rudra.
      Walrasian Equilibrium: Hardness, Approximations and Tractable Instances.
      • Conference version: International Workshop on Internet and Network Economics (WINE), LNCS 3828, 141-150, 2005.
      • Best Student Paper Award.
      • Journal version: To appear in Algorithmica.
    • Ning Chen, Xiaotie Deng, Xiaoming Sun, and Andrew Chi-Chih Yao.
      Fisher Equilibrium Price with Concave Utility Functions.
      • Conference version: European Symposium on Algorithms (ESA), LNCS 3221, 169-179, 2004.
    • Ning Chen, Xiaotie Deng, Xiaoming Sun, and Andrew Chi-Chih Yao.
      Dynamic Price Sequence and Incentive Compatibility.
      • Conference version: International Colloquium on Automata, Languages and Programming (ICALP), LNCS 3142, 320-331, 2004.
    • Ning Chen, Xiaotie Deng, and Xiaoming Sun.
      On Complexity of Single-Minded Auction.
      • Journal version: Journal of Computer and System Sciences (JCSS), Vol. 69(4), 675-687, 2004.
    • Ning Chen, and Hong Zhu.
      Fully Truthful Mechanisms.
      • Conference version: International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), LNCS 2932, 373-384, 2004.
      • Best Student Paper Award.
    • Ning Chen, Xiaotie Deng, and Hong Zhu.
      Combinatorial Auction across Independent Markets.
      • Conference version: ACM Conference on E-Commerce (EC), 206-207, 2003.
    • Ning Chen, and Hong Zhu.
      Incentive Compatible Mechanism Based on Linear Pricing Schemes for Single-Minded Auction.
      • Conference version: Asian Computing Science Conference, LNCS 2896, 161-172, 2003.
    • Ning Chen, Jie Meng, Jiawei Rong, and Hong Zhu.
      Approximation for Dominating Set Problem with Measure Functions.
      • Journal version: Computing and Informatics, Vol. 23, 1001-1013, 2004.

    Last Update: October 28, 2007