8 citations · 9 across the 5 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.GT2018
On the parameterized complexity of manipulating Top Trading Cycles
William Phan, Christopher Purcell
We study the problem of exchange when 1) agents are endowed with heterogeneous indivisible objects, and 2) there is no money. In general, no rule satisfies the three central proper…
cs.CC2018
Role colouring graphs in hereditary classes
Christopher Purcell, Puck Rombach
We study the computational complexity of computing role colourings of graphs in hereditary classes. We are interested in describing the family of hereditary classes on which a role…