A game-theoretic framework to identify overlapping communities in social networks
- Wei Chen, Zhenming Liu, Xiaorui Sun, Yajun Wang
- Computer ScienceData mining and knowledge discovery
- 1 September 2010
The first time the community detection problem is addressed by a game-theoretic framework that considers community formation as the result of individual agents’ rational behaviors, and the algorithm is effective in identifying overlapping communities.
Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate
- Wei Chen, Alex Collins, Yifei Yuan
- Computer ScienceSDM
- 28 April 2011
This paper proposes an extension to the independent cascade model that incorporates the emergence and propagation of negative opinions, and designs an efficient algorithm to compute influence in tree structures, which is nontrivial due to the negativity bias in the model.
Asymptotically optimal strategy-proof mechanisms for two-facility games
- P. Lu, Xiaorui Sun, Yajun Wang, Z. Zhu
- EconomicsACM Conference on Economics and Computation
- 7 June 2010
This paper proves an Ω(n) lower bound of the social cost approximation ratio for deterministic strategy-proof mechanisms and provides the first randomized strategy-Proof mechanism with a constant approximation ratio of 4.1 and works in general metric spaces.
Linear regression without correspondence
- Daniel J. Hsu, K. Shi, Xiaorui Sun
- Mathematics, Computer ScienceNIPS
- 1 May 2017
This article considers algorithmic and statistical aspects of linear regression when the correspondence between the covariates and the responses is unknown. First, a fully polynomial-time…
Efficient density estimation via piecewise polynomial approximation
- S. Chan, Ilias Diakonikolas, R. Servedio, Xiaorui Sun
- Mathematics, Computer ScienceSymposium on the Theory of Computing
- 14 May 2013
A computationally efficient semi-agnostic algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions, which is applied to obtain a wide range of results for many natural density estimation problems over both continuous and discrete domains.
The Complexity of Optimal Multidimensional Pricing
- X. Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, M. Yannakakis
- BusinessACM-SIAM Symposium on Discrete Algorithms
- 8 November 2013
It is shown that the problem of computing a revenue-optimal pricing can be solved in polynomial time for distributions of support size 2 and its decision version is NP-complete for distributionsof support size 3.
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms
- X. Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, M. Yannakakis
- Computer ScienceIEEE Annual Symposium on Foundations of Computer…
- 17 October 2015
It is shown that, when distributions have support size 2 and share the same high value, the simpler scheme of item pricing can achieve the same revenue as the optimal menu of lotteries.
Participation Maximization Based on Social Influence in Online Discussion Forums
- Tao Sun, Wei Chen, Chin-Yew Lin
- Computer ScienceInternational Conference on Web and Social Media
- 5 July 2011
This paper proposes a heuristic algorithm, named Thread Allocation Based on Influence (TABI), which consistently outperforms all other algorithms in maximizing participation and demonstrates that current recommender systems can be made more effective by considering future influence propagations.
The complexity of optimal multidimensional pricing for a unit-demand buyer
- Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, M. Yannakakis
- BusinessGames Econ. Behav.
- 1 July 2018
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs
- Sepehr Assadi, Xiaorui Sun, Omri Weinstein
- Computer Science, MathematicsACM SIGACT-SIGOPS Symposium on Principles of…
- 8 May 2018
An MPC algorithm that finds all connected components with spectral gap at least λ in a graph in O(log log n + log(1/λ)) MPC rounds and nδ memory per machine for any constant δ ∈ (0,1).