关注
Ning Chen
Ning Chen
Advance Intelligence Group
在 advance.ai 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
On the approximability of influence in social networks
N Chen
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008
5042008
Approximating matches made in heaven
N Chen, N Immorlica, A Karlin, M Mahdian, A Rudra
Automata, Languages and Programming, 266-278, 2009
1472009
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
1422011
Auctions for social lending: A theoretical analysis
N Chen, A Ghosh, NS Lambert
Games and Economic Behavior 86, 367-391, 2014
110*2014
Optimal proportional cake cutting with connected pieces
X Bei, N Chen, X Hua, B Tao, E Yang
Proc. of 26th AAAI, forthcoming, 2012
932012
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
762012
Optimal envy-free pricing with metric substitutability
N Chen, A Ghosh, S Vassilvitskii
Proceedings of the 9th ACM Conference on Electronic Commerce, 60-69, 2008
572008
How profitable are strategic behaviors in a market?
N Chen, X Deng, J Zhang
Algorithms–ESA 2011, 106-118, 2011
552011
Incentive ratios of fisher markets
N Chen, X Deng, H Zhang, J Zhang
Automata, Languages, and Programming, 464-475, 2012
462012
Optimal competitive auctions
N Chen, N Gravin, P Lu
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
432014
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
41*2011
Truthful generalized assignments via stable matching
N Chen, N Gravin, P Lu
Mathematics of Operations Research 39 (3), 722-736, 2014
39*2014
Cake Cutting: Envy and Truth.
X Bei, N Chen, G Huzhang, B Tao, J Wu
IJCAI, 3625-3631, 2017
382017
Improved approximation algorithms for the spanning star forest problem
N Chen, R Engelberg, C Thach Nguyen, P Raghavendra, A Rudra, ...
Algorithmica 65, 498-516, 2013
35*2013
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
342013
Envy-free pricing in multi-item markets
N Chen, X Deng
Automata, Languages and Programming, 418-429, 2010
332010
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
312010
Assignment problems in rental markets
D Abraham, N Chen, V Kumar, V Mirrokni
Internet and Network Economics, 198-213, 2006
312006
Fisher equilibrium price with a class of concave utility functions
N Chen, X Deng, X Sun, A Yao
Algorithms–ESA 2004, 169-179, 2004
302004
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
292010
系统目前无法执行此操作,请稍后再试。
文章 1–20