15 citations · 19 across the 7 of their papers we have counts for
7 papers
Algorithms and Complexity for Congested Assignments
Jiehua Chen, Jiong Guo, Yinghui Wen
We study the congested assignment problem as introduced by Bogomolnaia and Moulin (2023). We show that deciding whether a competitive assignment exists can be done in polynomial ti…
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Robert Bredereck, Jiehua Chen, Piotr Faliszewski +3
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (…
How Credible is the Prediction of a Party-Based Election?
Jiong Guo, Yash Raj Shrestha, Yongjie Yang
In a party-based election system, the voters are grouped into parties and all voters of a party are assumed to vote according to the party preferences over the candidates. Hence, o…
Parameterized Complexity of Edge Interdiction Problems
Jiong Guo, Yash Raj Shrestha
We study the parameterized complexity of interdiction problems in graphs. For an optimization problem on graphs, one can formulate an interdiction problem as a game consisting of t…
Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems
Yongjie Yang, Jiong Guo
Both weighted and unweighted Borda manipulation problems have been proved -hard. However, there is no exact combinatorial algorithm known for these problems. In this…
The Control Complexity of -Approval: from the Single-Peaked Case to the General Case
Yongjie Yang, Jiong Guo
We investigate the complexity of -Approval control problems in -peaked elections, where at most peaks are allowed in each vote with respect to an order of the candidates.…