15 citations · 41 across the 19 of their papers we have counts for
22 papers
How Hard Is It to Impact the Impact of Your Paper?
Yongjie Yang
Consolidation-disruption index (CD index) is a metric for qualitatively measuring the contribution of a patent or a research paper. Since its inception, a plethora of experimental…
When Graph Traversal Meets Structured Preferences: Unified Framework and Complexity Results
Guozhen Rong, Xin Li, Yongjie Yang
Preference restrictions have played a significant role in computational social choice. This paper studies a framework that connects preference restrictions with classical graph sea…
Zeroth-Order Optimization is Secretly Single-Step Policy Optimization
Junbin Qiu, Zhengpeng Xie, Xiangda Yan +2
Zeroth-Order Optimization (ZOO) provides powerful tools for optimizing functions where explicit gradients are unavailable or expensive to compute. However, the underlying mechanism…
On the Parameterized Complexity of Controlling Approval-Based Multiwinner Voting: Destructive Model \& Sequential Rules
Yongjie Yang
Over the past few years, the (parameterized) complexity landscape of constructive control for many prevalent approval-based multiwinner voting (ABMV) rules has been explored. We ex…
Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting
Yongjie Yang
We investigate the complexity of several manipulation and control problems under numerous prevalent approval-based multiwinner voting rules. Particularly, the rules we study includ…
Group Control for Procedural Rules: Parameterized Complexity and Consecutive Domains
Yongjie Yang, Dinko Dimitrov
We consider Group Control by Adding Individuals (GCAI) in the setting of group identification for two procedural rules -- the consensus-start-respecting rule and the liberal-start-…
Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability
Yongjie Yang, Jianxin Wang
We study the parameterized complexity of winner determination problems for three prevalent -committee selection rules, namely the minimax approval voting (MAV), the proportional…
A Refined Study of the Complexity of Binary Networked Public Goods Games
Yongjie Yang, Jianxin Wang
We study the complexity of several combinatorial problems in the model of binary networked public goods games. In this game, players are represented by vertices in a network, and t…
Cycle Extendability of Hamiltonian Strongly Chordal Graphs
Guozhen Rong, Wenjun Li, Jianxin Wang +1
In 1990, Hendry conjectured that all Hamiltonian chordal graphs are cycle extendable. After a series of papers confirming the conjecture for a number of graph classes, the conjectu…
On the Complexity of Constructive Control under Nearly Single-Peaked Preferences
Yongjie Yang
We investigate the complexity of {\sc{Constructive Control by Adding/Deleting Votes}} (CCAV/CCDV) for -approval, Condorcet, Maximin and Copeland in -axes and -candidat…
On the Complexity of Destructive Bribery in Approval-Based Multi-winner Voting
Yongjie Yang
A variety of constructive manipulation, control, and bribery problems for approval-based multiwinner voting have been extensively studied recently. However, their destructive count…
Recognizing Linked Domain in Polynomial Time
Yongjie Yang
The celebrated Gibbard-Satterthwaite Theorem states that any surjective social choice function which is defined over the universal domain of preferences and is strategy-proof must…
Improved Kernels and Algorithms for Claw and Diamond Free Edge Deletion Based on Refined Observations
Wenjun Li, Huan Peng, Yongjie Yang
In the {claw, diamond}-free edge deletion problem, we are given a graph and an integer , the question is whether there are at most edges whose deletion results in a gr…
Approval Voting with Intransitive Preferences
Yongjie Yang
We extend Approval voting to the settings where voters may have intransitive preferences. The major obstacle to applying Approval voting in these settings is that voters are not ab…
The Complexity of Shelflisting
Yongjie Yang, Dinko Dimitrov
Optimal shelflisting invites profit maximization to become sensitive to the ways in which purchasing decisions are order-dependent. We study the computational complexity of the cor…
A Further Step Towards an Understanding of the Tournament Equilibrium Set
Yongjie Yang
We study some problems pertaining to the tournament equilibrium set (TEQ for short). A tournament is a TEQ-retentive tournament if there is a tournament which has a minimal…
How Hard Is It to Control A Group?
Yongjie Yang, Dinko Dimitrov
We consider group identification models in which the aggregation of individual opinions concerning who is qualified in a given society determines the set of socially qualified pers…
Further Kernelization of Proper Interval Vertex Deletion: New Observations and Refined Analysis
Wenjun Li, Yongjie Yang, Jianer Chen +1
In the Proper Interval Vertex Deletion problem (PIVD for short), we are given a graph and an integer parameter , and the question is whether there are at most vertices…
Election Attacks with Few Candidates
Yongjie Yang
We investigate the parameterized complexity of strategic behaviors in generalized scoring rules. In particular, we prove that the manipulation, control (all the 22 standard types),…
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…
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.…