Parametrized algorithms for random serial dictatorship

DOI10.1016/j.mathsocsci.2014.07.002zbMath1308.91052arXiv1403.0974OpenAlexW2171419939MaRDI QIDQ477775

Julián Mestre, Haris Aziz

Publication date: 9 December 2014

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.0974

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social choice (91B14)

Related Items (2)

The Complexity of Computing the Random Priority Allocation Matrix ⋮ Counting houses of Pareto optimal matchings in the house allocation problem

Cites Work

• Unnamed Item
• Fundamentals of parameterized complexity
• Queue allocation of indivisible goods
• The computational complexity of random serial dictatorship
• Majority and Positional Voting in a Probabilistic Framework
• Social Welfare in One-Sided Matching Markets without Money
• Scheduling with Opting Out: Improving upon Random Priority
• Manipulation of Schemes that Mix Voting with Chance
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• A new solution to the random assignment problem.

This page was built for publication: Parametrized algorithms for random serial dictatorship