Tradeoffs between information and ordinal approximation for bipartite matching
From MaRDI portal
Publication:5894698
DOI10.1007/978-3-319-66700-3_21zbMath1403.91253arXiv1707.01608OpenAlexW2733333806WikidataQ129358748 ScholiaQ129358748MaRDI QIDQ5894698
Elliot Anshelevich, Wennan Zhu
Publication date: 13 February 2018
Published in: Theory of Computing Systems, Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.01608
matchingmetric spaceordinal preferencesapproximation algorithmsbipartite matchingordinal approximation algorithms
Related Items (3)
Ordinal approximation for social choice, matching, and facility location problems given candidate positions ⋮ Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond ⋮ Peeking behind the ordinal curtain: improving distortion via cardinal queries
Cites Work
- Unnamed Item
- Unnamed Item
- Approximating optimal social choice under metric preferences
- Optimal social choice functions: a utilitarian view
- Size versus truthfulness in the house allocation problem
- Truthful Approximations to Range Voting
- Social Welfare in One-Sided Matchings: Random Priority and Beyond
- Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship
- Truthful Mechanisms for Matching and Clustering in an Ordinal World
- Welfare maximization and truthfulness in mechanism design with ordinal preferences
- Social Welfare in One-Sided Matching Markets without Money
- Popular Matchings
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
This page was built for publication: Tradeoffs between information and ordinal approximation for bipartite matching
