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