2 citations · 5 across the 5 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.GT2021★ 2 cited
Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms
Xiaoxi Guo, Sujoy Sikdar, Lirong Xia +2
In the assignment problem, the goal is to assign indivisible items to agents who have ordinal preferences, efficiently and fairly, in a strategyproof manner. In practice, first-cho…
cs.GT2021
Sequential Mechanisms for Multi-type Resource Allocation
Sujoy Sikdar, Xiaoxi Guo, Haibin Wang +2
Several resource allocation problems involve multiple types of resources, with a different agency being responsible for "locally" allocating the resources of each type, while a cen…