Showing cs.GTShow all
3 papers · 1 filter
cs.GT2026
How Well Can Strategyproof Tournament Rules Resist Pairwise Manipulation?
Ke Ding, Bo Li, Fangxiao Wang
A tournament rule maps the outcomes of all pairwise matches among teams to a possibly randomized winner. Desirable rules should be Condorcet consistent and monotone, yet also r…
cs.GT2026
Approximate Maximin Share with Subjective Divisibility: Beating the 1/2 Barrier
Xiaohui Bei, Ke Ding, Bo Li +1
Maximin share (MMS) stands out as a central notion in fair resource allocation. It is known that exact MMS fairness is not always attainable, especially when agents differ along tw…
cs.GT2026
Multi-Agent Non-Discriminatory Contracts
Ke Ding, Bo Li, Ankang Sun
We study multi-agent contracts, in which a principal delegates a task to multiple agents and incentivizes them to exert effort. Prior research has mostly focused on maximizing the…