Xujin Chen

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 36

Top Topics

Network Externalities

Facility Location

Nash Equilibria

Pareto Optimality

Top Venues

Theor. Comput. Sci.

J. Comb. Optim.

Math. Oper. Res.

Publications

Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao
Packing Feedback Arc Sets in Tournaments Exactly. Math. Oper. Res. 49 (1) (2024)
Xujin Chen, Xiaodong Hu, Chenhao Wang, Xiaoying Wu, Mengqi Zhang
Algorithms for maximum social welfare of online random trading. Discret. Appl. Math. 354 (2024)
Zhigang Cao, Bo Chen, Xujin Chen, Changjun Wang
Bounding Residence Times for Atomic Dynamic Routings. Math. Oper. Res. 47 (4) (2022)
Xujin Chen, Zhuo Diao, Xiao-Dong Hu
On weak Pareto optimality of nonatomic routing networks. J. Comb. Optim. 44 (3) (2022)
Martin Hoefer, Xujin Chen, Nikolai Gravin, Ruta Mehta
Introduction to the Special Issue on WINE'20: Part 1. ACM Trans. Economics and Comput. 10 (2) (2022)
Xujin Chen, Minming Li, Changjun Wang, Chenhao Wang, Mengqi Zhang, Yingchao Zhao
Mechanisms for dual-role-facility location games: Truthfulness and approximability. Theor. Comput. Sci. 932 (2022)
Xujin Chen, Xiaodong Hu, Zhongzheng Tang, Chenhao Wang
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game. Inf. Process. Lett. 168 (2021)
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia, Zhongzheng Tang, Chenhao Wang, Ying Zhang
Algorithms for the metric ring star problem with fixed edge-cost ratio. J. Comb. Optim. 42 (3) (2021)
Zhigang Cao, Bo Chen, Xujin Chen, Changjun Wang
Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents. Oper. Res. 69 (6) (2021)
Xujin Chen, Xiaodong Hu, Chenhao Wang, Xiaoying Wu
The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler. Theor. Comput. Sci. 838 (2020)
Xujin Chen, Minming Li, Chenhao Wang
Favorite-Candidate Voting for Eliminating the Least Popular Candidate in a Metric Space. AAAI (2020)
Xujin Chen, Xiaodong Hu, Mengqi Zhang
Sequential Location Game on Continuous Directional Star Networks. Complexity and Approximation (2020)
Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao
Ranking tournaments with no errors I: Structural description. J. Comb. Theory, Ser. B 141 (2020)
Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao
Ranking tournaments with no errors II: Minimax relation. J. Comb. Theory, Ser. B 142 (2020)
Xujin Chen, Xiaodong Hu, Xiaoying Wu
The Price of Anarchy for the Load Balancing Game with a Randomizing Scheduler. COCOA (2019)
Xujin Chen, Minming Li, Changjun Wang, Chenhao Wang, Yingchao Zhao
Truthful Mechanisms for Location Games of Dual-Role Facilities. AAMAS (2019)
Xujin Chen, Minming Li, Chenhao Wang
Favorite-Candidate Voting for Eliminating the Least Popular Candidate in Metric Spaces. CoRR (2019)
Xujin Chen, Wenan Zang, Qiulan Zhao
Densities, Matchings, and Fractional Edge-Colorings. SIAM J. Optim. 29 (1) (2019)
Xujin Chen, Xiaodong Hu, Xiaohua Jia, Minming Li, Zhongzheng Tang, Chenhao Wang
Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance. SAGT (2018)
Xujin Chen, Zhuo Diao, Xiaodong Hu, Zhongzheng Tang
Covering Triangles in Edge-Weighted Graphs. Theory Comput. Syst. 62 (6) (2018)
Xujin Chen, Xiaodong Hu, Chenhao Wang
The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty. SAGT (2018)
Zhigang Cao, Bo Chen, Xujin Chen, Changjun Wang
A Network Game of Dynamic Traffic. CoRR (2017)
Xujin Chen, Xiaodong Hu, Changjun Wang, Ying Zhang
Continuous Firefighting on Infinite Square Grids. TAMC (2017)
Zhigang Cao, Xujin Chen, Xiaodong Hu, Changjun Wang
Approximation algorithms for pricing with negative network externalities. J. Comb. Optim. 33 (2) (2017)
Xujin Chen, Xiaodong Hu, Zhongzheng Tang, Chenhao Wang, Ying Zhang
Algorithms for the Ring Star Problem. COCOA (2) (2017)
Xujin Chen, Xiaodong Hu, Tie-Yan Liu, Weidong Ma, Tao Qin, Pingzhong Tang, Changjun Wang, Bo Zheng
Efficient Mechanism Design for Online Scheduling (Extended Abstract). IJCAI (2017)
Zhigang Cao, Bo Chen, Xujin Chen, Changjun Wang
A Network Game of Dynamic Traffic. EC (2017)
Xujin Chen, Xiaodong Hu, Changjun Wang
Finding connected k-subgraphs with high density. Inf. Comput. 256 (2017)
Xujin Chen, Zhuo Diao
Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing. COCOON (2016)
Xujin Chen, Zhuo Diao, Xiao-Dong Hu, Zhongzheng Tang
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles. IWOCA (2016)
Xujin Chen, Xiaodong Hu, Tie-Yan Liu, Weidong Ma, Tao Qin, Pingzhong Tang, Changjun Wang, Bo Zheng
Efficient Mechanism Design for Online Scheduling. J. Artif. Intell. Res. 56 (2016)
Xujin Chen, Zhuo Diao, Xiaodong Hu
Network Characterizations for Excluding Braess's Paradox. Theory Comput. Syst. 59 (4) (2016)
Xujin Chen, Zhuo Diao, Xiaodong Hu, Zhongzheng Tang
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles. CoRR (2016)
Xujin Chen, Xiao-Dong Hu, Changjun Wang
Approximation for the minimum cost doubly resolving set problem. Theor. Comput. Sci. 609 (2016)
Qin Chen, Xujin Chen, Wenan Zang
A Polyhedral Description of Kernels. Math. Oper. Res. 41 (3) (2016)
Xujin Chen, Zhuo Diao, Xiao-Dong Hu, Zhongzheng Tang
Total Dual Integrality of Triangle Covering. COCOA (2016)
Xujin Chen, Zhuo Diao, Xiao-Dong Hu
Excluding Braess's Paradox in Nonatomic Selfish Routing. SAGT (2015)
Xujin Chen, Xiao-Dong Hu, Weidong Ma
Balancing Load via Small Coalitions in Selfish Ring Routing Games. Asia Pac. J. Oper. Res. 32 (1) (2015)
Changjun Wang, Weidong Ma, Tao Qin, Feidiao Yang, Tie-Yan Liu, Xujin Chen, Xiao-Dong Hu
New Mechanism for Reservation in Cloud Computing. AAMAS (2015)
Xujin Chen, Donglei Du, Luis Fernando Zuluaga
Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines. Theory Comput. Syst. 57 (3) (2015)
Xujin Chen, Xiao-Dong Hu, Changjun Wang
Finding Connected Dense $k$-Subgraphs. CoRR (2015)
Zhigang Cao, Xujin Chen, Xiaodong Hu, Changjun Wang
Pricing in Social Networks with Negative Externalities. CSoNet (2015)
Xujin Chen, Xiao-Dong Hu, Changjun Wang
Finding Connected Dense k -Subgraphs. TAMC (2015)
Changjun Wang, Weidong Ma, Tao Qin, Xujin Chen, Xiaodong Hu, Tie-Yan Liu
Selling Reserved Instances in Cloud Computing. IJCAI (2015)
Xujin Chen, Benjamin Doerr, Carola Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee
The Price of Anarchy for Selfish Ring Routing is Two. ACM Trans. Economics and Comput. 2 (2) (2014)
Zhigang Cao, Xujin Chen, Changjun Wang
Schedules for marketing products with negative externalities. Theor. Comput. Sci. 554 (2014)
Zhigang Cao, Xujin Chen, Xiao-Dong Hu, Changjun Wang
Pricing in Social Networks with Negative Externalities. CoRR (2014)
Xujin Chen, Xiaodong Hu, Changjun Wang
Approximability of the Minimum Weighted Doubly Resolving Set Problem. CoRR (2014)
Xujin Chen, Changjun Wang
Approximability of the Minimum Weighted Doubly Resolving Set Problem. COCOON (2014)
Xujin Chen, Xiaodong Hu, Weidong Ma, Changjun Wang
Reducing price of anarchy of selfish task allocation with more selfishness. Theor. Comput. Sci. 507 (2013)
Zhigang Cao, Xujin Chen, Changjun Wang
How to Schedule the Marketing of Products with Negative Externalities. COCOON (2013)
Xujin Chen, Leah Epstein, Elena Kleiman, Rob van Stee
Maximizing the minimum load: The cost of selfishness. Theor. Comput. Sci. 482 (2013)
Zhigang Cao, Xujin Chen, Changjun Wang
How to Schedule the Marketing of Products with Negative Externalities CoRR (2013)
Xujin Chen, Donglei Du, Luis Fernando Zuluaga
Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines. CoRR (2013)
Xujin Chen, Donglei Du, Luis Fernando Zuluaga
Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines. SAGT (2013)
Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen
The Price of Anarchy for Selfish Ring Routing is Two CoRR (2012)
Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang
Bonds with parity constraints. J. Comb. Theory, Ser. B 102 (3) (2012)
Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen
The Price of Anarchy for Selfish Ring Routing Is Two. WINE (2012)
Xujin Chen, Xiaodong Hu, Weidong Ma
Pairwise cooperations in selfish ring routing for minimax linear latency. Theor. Comput. Sci. 447 (2012)
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
The Maximum-Weight Stable Matching Problem: Duality and Efficiency. SIAM J. Discret. Math. 26 (3) (2012)
Xujin Chen, Xiaodong Hu, Weidong Ma, Changjun Wang
Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines. COCOA (2012)
Xujin Chen, Zhibin Chen, Wenan Zang
Total Dual Integrality in Some Facility Location Problems. SIAM J. Discret. Math. 26 (3) (2012)
Qin Chen, Xujin Chen
Packing cycles exactly in polynomial time. J. Comb. Optim. 23 (2) (2012)
Eduardo Álvarez-Miranda, Xujin Chen, Jie Hu, Xiaodong Hu, Alfredo Candia-Véjar
Deterministic risk control for cost-effective network connections. Theor. Comput. Sci. 412 (3) (2011)
Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Xujin Chen, Xiaodong Hu, Bi Li
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data. AAIM (2010)
Xujin Chen, Xiaodong Hu, Weidong Ma
Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations. COCOA (2) (2010)
Bo Chen, Xujin Chen, Xiaodong Hu
The price of atomic selfish ring routing. J. Comb. Optim. 19 (3) (2010)
Xujin Chen, Zhibin Chen, Wenan Zang
A Unified Approach to Box-Mengerian Hypergraphs. Math. Oper. Res. 35 (3) (2010)
Xujin Chen, Xiaodong Hu, Jianming Zhu
Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks. Int. J. Distributed Sens. Networks 5 (4) (2009)
Xujin Chen, Guoli Ding, Wenan Zang
The box-TDI system associated with 2-edge connected spanning subgraphs. Discret. Appl. Math. 157 (1) (2009)
Xujin Chen, Bo Chen
Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design. Algorithmica 53 (3) (2009)
Xujin Chen, Jie Hu, Xiaodong Hu
A polynomial solvable minimum risk spanning tree problem with interval data. Eur. J. Oper. Res. 198 (1) (2009)
Xujin Chen, Jie Hu, Xiaodong Hu
A new model for path planning with interval data. Comput. Oper. Res. 36 (6) (2009)
Xujin Chen, Bo Chen
Cost-effective designs of fault-tolerant access networks in communication systems. Networks 53 (4) (2009)
Xujin Chen, Guoli Ding, Wenan Zang
A Characterization of Box-Mengerian Matroid Ports. Math. Oper. Res. 33 (2) (2008)
Xujin Chen, Xiaodong Hu, Xiaohua Jia
Inapproximability and approximability of minimal tree routing and coloring. J. Discrete Algorithms 6 (2) (2008)
Xujin Chen, Xiaodong Hu, Wenan Zang
A Min-Max Theorem on Tournaments. SIAM J. Comput. 37 (3) (2007)
Xujin Chen, Jie Hu, Xiaodong Hu
The Minimum Risk Spanning Tree Problem. COCOA (2007)
Min Xu, Xujin Chen, Xiaodong Hu
On the restricted forwarding index problem in communication networks. Comput. Math. Appl. 53 (11) (2007)
Xujin Chen, Jie Hu, Xiaodong Hu
On the Minimum Risk-Sum Path Problem. ESCAPE (2007)
Xujin Chen, Wenan Zang
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. Algorithmica 44 (3) (2006)
Xujin Chen, Xiaodong Hu, Tianping Shuai
Inapproximability and approximability of maximal tree routing and coloring. J. Comb. Optim. 11 (2) (2006)
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
A Min-Max Relation on Packing Feedback Vertex Sets. Math. Oper. Res. 31 (4) (2006)
Jianming Zhu, Xujin Chen, Xiaodong Hu
Minimum Multicast Time Problem in Wireless Sensor Networks. WASA (2006)
Xujin Chen, Zhiquan Hu, Wenan Zang
Perfect Circular Arc Coloring. J. Comb. Optim. 9 (3) (2005)
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
Complexity of Minimal Tree Routing and Coloring. AAIM (2005)
Xujin Chen, Xiao-Dong Hu, Tianping Shuai
Routing and Coloring for Maximal Number of Trees. COCOON (2005)
Xujin Chen, Xiaodong Hu, Jianming Zhu
Minimum Data Aggregation Time Problem in Wireless Sensor Networks. MSN (2005)
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
A Min-Max Relation on Packing Feedback Vertex Sets. ISAAC (2005)
Xujin Chen, Wenan Zang
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. ISAAC (2004)