On the approximability of influence in social networks N Chen Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008 | 360 | 2008 |

Approximating matches made in heaven N Chen, N Immorlica, A Karlin, M Mahdian, A Rudra Automata, Languages and Programming, 266-278, 2009 | 97 | 2009 |

On the approximability of budget feasible mechanisms N Chen, N Gravin, P Lu Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 96 | 2011 |

Auctions for social lending: A theoretical analysis N Chen, A Ghosh, NS Lambert Games and Economic Behavior 86, 367-391, 2014 | 90* | 2014 |

Budget Feasible Mechanism Design: From Prior-Free to Bayesian X Bei, N Chen, N Gravin, P Lu Proceedings of the 44th ACM Symposium on Theory of Computing, 2012 | 58 | 2012 |

Optimal proportional cake cutting with connected pieces X Bei, N Chen, X Hua, B Tao, E Yang Proc. of 26th AAAI, forthcoming, 2012 | 56 | 2012 |

Optimal envy-free pricing with metric substitutability N Chen, A Ghosh, S Vassilvitskii SIAM Journal on Computing 40 (3), 623-645, 2011 | 51 | 2011 |

How profitable are strategic behaviors in a market? N Chen, X Deng, J Zhang Algorithms–ESA 2011, 106-118, 2011 | 36 | 2011 |

Truthful generalized assignments via stable matching N Chen, N Gravin, P Lu Mathematics of Operations Research 39 (3), 722-736, 2014 | 33* | 2014 |

Frugal mechanism design via spectral techniques N Chen, E Elkind, N Gravin, F Petrov Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer …, 2010 | 32 | 2010 |

Improved approximation algorithms for the spanning star forest problem N Chen, R Engelberg, CT Nguyen, P Raghavendra, A Rudra, G Singh Algorithmica 65 (3), 498-516, 2013 | 31* | 2013 |

Incentive ratios of fisher markets N Chen, X Deng, H Zhang, J Zhang Automata, Languages, and Programming, 464-475, 2012 | 31 | 2012 |

Envy-free pricing in multi-item markets N Chen, X Deng Automata, Languages and Programming, 418-429, 2010 | 31 | 2010 |

Optimal competitive auctions N Chen, N Gravin, P Lu Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 30 | 2014 |

Dynamics of Profit-Sharing Games J Augustine, N Chen, E Elkind, A Fanelli, N Gravin, D Shiryaev Twenty-Second International Joint Conference on Artificial Intelligence, 2011 | 30* | 2011 |

Dynamic pricing for impatient bidders N Bansal, N Chen, N Cherniavsky, A Rurda, B Schieber, M Sviridenko ACM Transactions on Algorithms (TALG) 6 (2), 1-21, 2010 | 29 | 2010 |

Fisher equilibrium price with a class of concave utility functions N Chen, X Deng, X Sun, A Yao Algorithms–ESA 2004, 169-179, 2004 | 29 | 2004 |

Cheap labor can be expensive N Chen, AR Karlin SODA 7, 707-715, 2007 | 26 | 2007 |

On the complexity of trial and error X Bei, N Chen, S Zhang Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 23 | 2013 |

Assignment problems in rental markets D Abraham, N Chen, V Kumar, V Mirrokni Internet and Network Economics, 198-213, 2006 | 21 | 2006 |