@inproceedings{rrard2011,
	Abstract = {The room assignment-rent division problem allocates a heterogeneous set of indivisible items (e.g. rooms in a house) along with a share of some divisible item (e.g. the rent for the house), such that all items and resources are allocated without surplus or deficit, and each agent receives exactly one indivisible item.  It is desirable to have envy-free outcomes but this is not possible for deterministic, truthful mechanisms.  In this work we present truthful, randomised mechanisms for this problem, along with new measures of envy appropriate for non-deterministic mechanisms.},
	Address = {Barcelona, Spain},
	Author = {Lachlan Dufton and Kate Larson},
	Booktitle = {IJCAI-2011 Workshop on Social Choice and Artificial Intelligence (WSCAI-2011)},
	Month = {July},
	Title = {Randomised Room Assignment-Rent Division},
	Year = {2011}}