6 citations · 16 across the 13 of their papers we have counts for
14 papers
Network Topology That Excludes Braess's Paradox and Maintains Monotonicity in Flows Over Time
Xujin Chen, Xiyuan Deng, Changjun Wang
In the game of \emph{flow over time}, infinitesimal flow particles aim to travel from a source to a sink in a network as quickly as possible. Under the Vickrey bottleneck model, th…
Online Trading as a Secretary Problem Variant
Xujin Chen, Xiaodong Hu, Changjun Wang +2
This paper studies an online trading variant of the classical secretary problem, called secretary problem variant trading (SPVT), from the perspective of an intermediary who facili…
Supermodular Maximization with Cardinality Constraints
Xujin Chen, Xiaodong Hu, Changjun Wang +1
Let be a finite set of elements, be a nonnegative monotone supermodular function, and be a positive integer no greater than . This…
When does additional information lead to longer travel time in multi-origin-destination networks?
Xujin Chen, Xiaodong Hu, Xinqi Jing +1
The Informational Braess' Paradox (IBP) illustrates a counterintuitive scenario where revelation of additional roadway segments to some self-interested travelers leads to increased…
Favorite-Candidate Voting for Eliminating the Least Popular Candidate in Metric Spaces
Xujin Chen, Minming Li, Chenhao Wang
We study single-candidate voting embedded in a metric space, where both voters and candidates are points in the space, and the distances between voters and candidates specify the v…
Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance
Xujin Chen, Xiaodong Hu, Xiaohua Jia +3
This paper is devoted to the two-opposite-facility location games with a penalty whose amount depends on the distance between the two facilities to be opened by an authority. The t…
A Network Game of Dynamic Traffic
Zhigang Cao, Bo Chen, Xujin Chen +1
We study a network congestion game of discrete-time dynamic traffic of atomic agents with a single origin-destination pair. Any agent freely makes a dynamic decision at each vertex…
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles
Xujin Chen, Zhuo Diao, Xiaodong Hu +1
Given a simple graph , a subset of is called a triangle cover if it intersects each triangle of . Let and denote the maximum number of pairwise ed…
Finding Connected Dense -Subgraphs
Xujin Chen, Xiaodong Hu, Changjun Wang
Given a connected graph on vertices and a positive integer , a subgraph of on vertices is called a -subgraph in . We design combinatorial approximatio…
Pricing in Social Networks with Negative Externalities
Zhigang Cao, Xujin Chen, Xiaodong Hu +1
We study the problems of pricing an indivisible product to consumers who are embedded in a given social network. The goal is to maximize the revenue of the seller. We assume impati…
Approximability of the Minimum Weighted Doubly Resolving Set Problem
Xujin Chen, Xiaodong Hu, Changjun Wang
Locating source of diffusion in networks is crucial for controlling and preventing epidemic risks. It has been studied under various probabilistic models. In this paper, we study s…
Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines
Xujin Chen, Donglei Du, Luis F. Zuluaga
We design a Copula-based generic randomized truthful mechanism for scheduling on two unrelated machines with approximation ratio within , offering an improved up…
How to Schedule the Marketing of Products with Negative Externalities
Zhigang Cao, Xujin Chen, Changjun Wang
In marketing products with negative externalities, a schedule which specifies an order of consumer purchase decisions is crucial, since in the social network of consumers, the deci…
The Price of Anarchy for Selfish Ring Routing is Two
Xujin Chen, Benjamin Doerr, Xiaodong Hu +3
We analyze the network congestion game with atomic players, asymmetric strategies, and the maximum latency among all players as social cost. This important social cost function is…