Showing cs.GTShow all
3 papers · 1 filter
cs.GT2026
The Role of Degrees and Acyclic Neighborhoods in the Complexity of Tournament Fixing
Yuxi Liu, Junqiang Peng, Mingyu Xiao +1
The \textsc{Tournament Fixing} problem asks whether a knockout tournament can be scheduled to make a favorite player win when all pairwise match outcomes are given. Such tournament…
cs.GT2026
How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite?
Zhonghao Wang, Junqiang Peng, Yuxi Liu +1
In knockout tournaments, players compete in successive rounds, with losers eliminated and winners advancing until a single champion remains. Given a tournament digraph , which e…
cs.GT2025
Weighted Envy-Freeness Revisited: Indivisible Resource and House Allocations
Yuxi Liu, Mingyu Xiao
Envy-Freeness is one of the most fundamental and important concepts in fair allocation. Some recent studies have focused on the concept of weighted envy-freeness. Under this concep…