Ordinal approximation for social choice, matching, and facility location problems given candidate positions
From MaRDI portal
Publication:2190377
DOI10.1007/978-3-030-04612-5_1zbMath1443.91130arXiv1805.03103OpenAlexW3161198832MaRDI QIDQ2190377
Wennan Zhu, Elliot Anshelevich
Publication date: 18 June 2020
Full work available at URL: https://arxiv.org/abs/1805.03103
Related Items (8)
Approximate mechanism design for distributed facility location ⋮ Metric-distortion bounds under limited information ⋮ Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond ⋮ Facility location games with optional preference ⋮ Peeking behind the ordinal curtain: improving distortion via cardinal queries ⋮ The distortion of distributed metric social choice ⋮ Awareness of voter passion greatly improves the distortion of metric social choice ⋮ The distortion of distributed metric social choice
Cites Work
- Unnamed Item
- Unnamed Item
- Approximating optimal social choice under metric preferences
- Optimal social choice functions: a utilitarian view
- Social Welfare in One-Sided Matchings: Random Priority and Beyond
- Subset Selection Via Implicit Utilitarian Voting
- Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship
- Truthful Mechanisms for Matching and Clustering in an Ordinal World
- Randomized Social Choice Functions Under Metric Preferences
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Social Welfare in One-Sided Matching Markets without Money
- A Best Possible Heuristic for the k-Center Problem
- Sequential Deliberation for Social Choice
- An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
- Random Matching Under Dichotomous Preferences
- Tradeoffs between information and ordinal approximation for bipartite matching
This page was built for publication: Ordinal approximation for social choice, matching, and facility location problems given candidate positions
