3 citations · 8 across the 5 of their papers we have counts for
5 papers
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…
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…
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…
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…
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…