Yongjie Yang 0001
41 publications
6 venues
H Index 10
Affiliation
Central South University, School of Information Science and Engineering, Changsha, ChinaSaarland University, Chair of Economic Theory, Saarbr cken, Germany
Links
| Name | Venue | Year | citations |
|---|---|---|---|
On the Complexity of Candidates-Embedded Multiwinner Voting under the Hausdorff Function.
|
AAMAS | 2024 | 0 |
| How Hard Is It to Impact the Impact of Your Paper?
|
IJCAI | 2024 | 0 |
| On the Complexity of the Two-Stage Majority Rule.
|
AAMAS | 2023 | 0 |
| Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability.
|
Autonomous Agents and Multi-Agent Systems | 2023 | 0 |
| On the Complexity of Controlling Amendment and Successive Winners.
|
AAMAS | 2022 | 1 |
| On the Complexity of Calculating Approval-Based Winners in Candidates-Embedded Metrics.
|
IJCAI | 2022 | 0 |
| Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters.
|
Autonomous Agents and Multi-Agent Systems | 2021 | 0 |
| A Model of Winners Allocation.
|
AAAI | 2021 | 0 |
| The Nonmanipulative Vote-Deficits of Voting Rules.
|
ADT | 2021 | 0 |
| On the Complexity of Destructive Bribery in Approval-Based Multi-winner Voting.
|
AAMAS | 2020 | 4 |
| Microbribery in Group Identification.
|
AAMAS | 2020 | 4 |
| On the Complexity of Constructive Control Under Nearly Single-Peaked Preferences.
|
ECAI | 2020 | 6 |
| The complexity of bribery and control in group identification.
|
Autonomous Agents and Multi-Agent Systems | 2020 | 0 |
| On the Tree Representations of Dichotomous Preferences.
|
IJCAI | 2019 | 11 |
| Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting.
|
IJCAI | 2019 | 10 |
| Complexity of Additive Committee Selection with Outliers.
|
AAMAS | 2019 | 2 |
| Towards Completing the Puzzle: Solving Open Problems for Control in Elections.
|
AAMAS | 2019 | 6 |
| Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes.
|
AAMAS | 2019 | 7 |
| Resolution and Domination: An Improved Exact MaxSAT Algorithm.
|
IJCAI | 2019 | 4 |
| How Hard Is It to Control a Group?
|
AAMAS | 2019 | 0 |
| Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability.
|
AAMAS | 2018 | 10 |
| Complexity of Controlling Nearly Single-Peaked Elections Revisited.
|
AAMAS | 2018 | 2 |
| How hard is it to control a group?
|
Autonomous Agents and Multi-Agent Systems | 2018 | 2 |
| Multiwinner Voting with Restricted Admissible Sets: Complexity and Strategyproofness.
|
IJCAI | 2018 | 18 |
| The Complexity of Control and Bribery in Majority Judgment.
|
AAMAS | 2017 | 10 |
| Anyone But Them: The Complexity Challenge for A Resolute Election Controller.
|
AAMAS | 2017 | 9 |
| Complexity of Group Identification with Partial Information.
|
ADT | 2017 | 6 |
| On the Complexity of Borda Control in Single-Peaked Elections.
|
AAMAS | 2017 | 11 |
| The Complexity of Bribery and Control in Group Identification.
|
AAMAS | 2017 | 24 |
| Approval Voting with Intransitive Preferences.
|
AAMAS | 2017 | 3 |
| How Hard Is Bribery with Distance Restrictions?
|
ECAI | 2016 | 10 |
| How Hard is Bribery in Party Based Elections?
|
AAMAS | 2015 | 6 |
| When Does Schwartz Conjecture Hold?
|
IJCAI | 2015 | 8 |
| How Hard is Control in Multi-Peaked Elections: A Parameterized Study.
|
AAMAS | 2015 | 15 |
| Manipulation with Bounded Single-Peaked Width: A Parameterized Study.
|
AAMAS | 2015 | 19 |
| How Credible is the Prediction of a Party-Based Election?
|
AAMAS | 2015 | 0 |
| Election Attacks with Few Candidates.
|
ECAI | 2014 | 12 |
| Controlling elections with bounded single-peaked width.
|
AAMAS | 2014 | 25 |
| The control complexity of r-approval: from the single-peaked case to the general case.
|
AAMAS | 2014 | 0 |
| Exact algorithms for weighted and unweighted borda manipulation problems.
|
AAMAS | 2013 | 12 |
| Possible Winner Problems on Partial Tournaments: A Parameterized Study.
|
ADT | 2013 | 15 |