OxTalks will soon be transitioning to Oxford Events (full details are available on the Staff Gateway). A two-week publishing freeze is expected to start before the end of Hilary Term to allow all future events to be migrated to the new platform. During this period, you will not be able to submit or edit events on OxTalks. The exact freeze dates will be confirmed on the Staff Gateway and via email to identified OxTalks users.
If you have any questions, please contact halo@digital.ox.ac.uk
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
