15 citations · 42 across the 17 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2021
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…
cs.GT2020★ 2 cited
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…