Publications
- Xiaohui Bei, Ning Chen, Nick Gravin, and Pinyan Lu.
Budget Feasible Mechanism Design: From Prior-Free to Bayesian.
- Conference version: ACM Symposium on Theory of Computing (STOC), 2012.
- Ning Chen.
On Computing Pareto Stable Assignments.
- Conference version: Symposium on Theoretical Aspects of Computer Science (STACS), 2012.
- Ning Chen, Xiaotie Deng, and Jie Zhang.
How Profitable are Strategic Behaviors in a Market?.
- Conference version: European Symposium on Algorithms (ESA), 2011.
- Ning Chen, and Arpita Ghosh.
A Market Clearing Solution for Social Lending.
- Conference version: International Joint Conference on Artificial Intelligence (IJCAI), 2011.
- John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, and Dmitry Shiryaev.
Dynamics of Profit-Sharing Games.
- Conference version: International Joint Conference on Artificial Intelligence (IJCAI), 2011.
- Nick Gravin, and Ning Chen.
A Note on k-Shortest Paths Problem.
- Journal version: Journal of Graph Theory, V.67(1), 37-37, 2011.
- Ning Chen, and Arpita Ghosh.
Strongly Stable Assignment.
- Conference version: European Symposium on Algorithms (ESA), 2010.
- Ning Chen, and Xiaotie Deng.
Envy-Free Pricing in Multi-Item Markets.
- Conference version: International Colloquium on Automata, Languages and Programming (ICALP), 2010.
- Ning Chen, Arpita Ghosh, and Nicolas Lambert.
Social Lending.
- Conference version: ACM Conference on Electronic Commerce (EC), 2009.
- Ning Chen, Nicole Immorlica, Anna Karlin, Mohammad Mahdian and Atri Rudra.
Approximating Matches Made in Heaven.
- Conference version: International Colloquium on Automata, Languages and Programming (ICALP), 2009.
- Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, and Ying Xu.
Deterministic Decentralized Search in Random Graphs.
- Conference version: Workshop on Algorithms and Models for the Web-Graph (WAW), 2007.
- Journal version: Internet Mathematics, V.5(1), 141-154, 2010.
- 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), 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), 2007.
- Journal version: ACM Transactions on Algorithms, V.6(2), 35, 2010.
- David Abraham, Ning Chen, Vijay Kumar, and Vahab Mirrokni.
Assignment Problems in Rental Market.
- Conference version: International Workshop on Internet and Network Economics (WINE), 2006.
- Ning Chen, and Atri Rudra.
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances.
- Conference version: International Workshop on Internet and Network Economics (WINE), 2005.
- Best Student Paper Award.
- Journal version: Algorithmica, V.52(1), 44-64, 2008.
- 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), 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), 2004.
- Ning Chen, Xiaotie Deng, and Xiaoming Sun.
On Complexity of Single-Minded Auction.
- Journal version: Journal of Computer and System Sciences (JCSS), V.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), 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), 2003.
- Ning Chen, Jie Meng, Jiawei Rong, and Hong Zhu.
Approximation for Dominating Set Problem with Measure Functions.
- Journal version: Computing and Informatics, V.23, 1001-1013, 2004.
|
