Oxford Events, the new replacement for OxTalks, will launch on 16th March. From now until the launch of Oxford Events, new events cannot be published or edited on OxTalks while all existing records are migrated to the new platform. The existing OxTalks site will remain available to view during this period.
From 16th, Oxford Events will launch on a new website: events.ox.ac.uk, and event submissions will resume. You will need a Halo login to submit events. Full details are available on the Staff Gateway.
We study a simple variant of the house allocation problem (one-sided matching). We demonstrate that agents with recursive preferences may systematically prefer one allocation mechanism to the other, even among mechanisms that are considered to be the same in standard models, in the sense that they induce the same probability distribution over successful matchings. Using this, we propose a new Priority Groups mechanism and provide conditions under which it is preferred to two popular mechanisms, Random Top Cycle and Random Serial Dictatorship.
Link to paper: cpb-us-w2.wpmucdn.com/web.sas.upenn.edu/dist/d/264/files/2017/01/Allocation_without_Reduction_ds.pdf
Please sign up for meetings here: docs.google.com/spreadsheets/d/1WTp83AxJaVGv6sMlwBer43q68i43dAe9BSeyb26ypa4/edit#gid=0
