The computational complexity of random serial dictatorship

DOI10.1016/J.ECONLET.2013.09.006MaRDI QIDQ6828614zbMATH OpenFDO

Authors Haris Aziz, Felix Brandt, Markus Brill

Publication date 6 June 2014

Published in Economics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ECONLET.2013.09.006

zbMATH Keywords

assignment problemcomputational complexityrandom priorityrandom serial dictatorshipsocial choice theory

Mathematics Subject Classification ID

Social choice (91B14)

Cited in

(2)

• Fair integer programming under dichotomous and cardinal preferences
• Estimating the expected social welfare and cost of random serial dictatorship

This page was built for publication: The computational complexity of random serial dictatorship

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828614)