The computational complexity of random serial dictatorship
Year of publication: |
2013
|
---|---|
Authors: | Aziz, Haris ; Brandt, Felix ; Brill, Markus |
Published in: |
Economics letters. - Amsterdam [u.a.] : Elsevier, ISSN 0165-1765, ZDB-ID 717210-2. - Vol. 121.2013, 3, p. 341-345
|
Subject: | Social choice theory | Random serial dictatorship | Random priority | Computational complexity | Assignment problem | Theorie | Theory | Neue politische Ökonomie | Public choice | Diktatur | Dictatorship | Mathematische Optimierung | Mathematical programming |
-
The computational complexity of random serial dictatorship
Aziz, Haris, (2013)
-
On the consistency of random serial dictatorship
Han, Xiang, (2016)
-
A general equivalence theorem for allocation of indivisible objects
Carroll, Gabriel, (2014)
- More ...
-
The computational complexity of random serial dictatorship
Aziz, Haris, (2013)
-
On the tradeoff between efficiency and strategyproofness
Aziz, Haris, (2018)
-
Testing substitutability of weak preferences
Aziz, Haris, (2013)
- More ...