Optimizing over serial dictatorships

DOI10.1007/978-3-031-43254-5_19zbMATH Open1537.91092MaRDI QIDQ6546303

I. Caragiannis, Nidhi Rathi

Publication date: 29 May 2024

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Social choice (91B14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The efficiency of fair division
• Priority algorithms for graph optimization problems
• Approximation algorithms for combinatorial problems
• (Incremental) priority algorithms
• Size versus truthfulness in the house allocation problem
• Strategy-proof allocation of indivisible goods
• Combinatorial auctions with decreasing marginal utilities
• On fairness via picking sequences in allocation of indivisible goods
• Social Welfare in One-Sided Matchings: Random Priority and Beyond
• Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship
• The Price of Fairness
• The Price of Stability for Network Design with Fair Cost Allocation
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
• Algorithmics of Matching Under Preferences
• Algorithms and Computation
• A new solution to the random assignment problem.

This page was built for publication: Optimizing over serial dictatorships