Improved truthful rank approximation for rank-maximal matchings
From MaRDI portal
Publication:6609179
DOI10.1007/978-3-031-48974-7_36MaRDI QIDQ6609179
Zhengyang Liu, Xiaotie Deng, Jianwei Yin, Jinshan Zhang
Publication date: 20 September 2024
Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rank-maximal matchings -- structure and algorithms
- Manipulation strategies for the rank-maximal matching problem
- Tight social welfare approximation of probabilistic serial
- Size versus truthfulness in the house allocation problem
- Size versus fairness in the assignment problem
- Dynamic rank-maximal and popular matchings
- Rank-maximal matchings
- Welfare maximization and truthfulness in mechanism design with ordinal preferences
- Coverings of Bipartite Graphs
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- House Markets with Matroid and Knapsack Constraints
- Capacitated Rank-Maximal Matchings
- A General Framework for Stable Roommates Problems using Answer Set Programming
- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
- A new solution to the random assignment problem.
- Stable and extremely unequal
- Envy-free matchings in bipartite graphs and their applications to fair division
This page was built for publication: Improved truthful rank approximation for rank-maximal matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609179)
