Truthful Mechanisms for Matching and Clustering in an Ordinal World
From MaRDI portal
Publication:2959835
DOI10.1007/978-3-662-54110-4_19zbMath1406.91273arXiv1610.04069OpenAlexW2534558652MaRDI QIDQ2959835
Shreyas Sekar, Elliot Anshelevich
Publication date: 10 February 2017
Published in: Web and Internet Economics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.04069
Matching models (91B68) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)
Related Items (6)
Ordinal approximation for social choice, matching, and facility location problems given candidate positions ⋮ Approximate and strategyproof maximin share allocation of chores with ordinal preferences ⋮ Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship ⋮ Truthful Mechanisms for Matching and Clustering in an Ordinal World ⋮ Tradeoffs between information and ordinal approximation for bipartite matching ⋮ Peeking behind the ordinal curtain: improving distortion via cardinal queries
Cites Work
- Voting almost maximizes social welfare despite limited communication
- Optimal social choice functions: a utilitarian view
- Deterministic 7/8-approximation for the metric maximum TSP
- Approximation algorithms for maximum dispersion
- 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
- Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design
- Randomized Social Choice Functions Under Metric Preferences
- A class of bounded approximation algorithms for graph partitioning
- Heuristic and Special Case Algorithms for Dispersion Problems
- Truthful randomized mechanisms for combinatorial auctions
This page was built for publication: Truthful Mechanisms for Matching and Clustering in an Ordinal World
