k-Best Egalitarian Stable Marriages for Task Assignment
Summary: Introduces efficient algorithms to enumerate the k best stable matchings ranked by egalitarian cost, rather than returning only Gale–Shapley’s side-optimal solution. Enables decision-makers to inspect diverse, balanced assignments with transparent reassignment trade-offs. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Siyuan Wu (University of Macau)
- 2. Leong Hou U (University of Macau)
- 3. Panagiotis Karras (Aarhus University)
BibTeX Citation
@article{wu_vldb23,
title = {{k-Best Egalitarian Stable Marriages for Task Assignment}},
author = {Wu, Siyuan and U, Leong Hou and Karras, Panagiotis},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {11},
pages = {3240--3252},
doi = {10.14778/3611479.3611522},
url = {https://doi.org/10.14778/3611479.3611522},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,661 | Online Minimum Matching in Real-Time Spatial Data: Experiments and Analysis | 2016 | VLDB | 6.5792798e-05 |
| 4,685 | Distributed Processing of k Shortest Path Queries over Dynamic Road Networks | 2020 | SIGMOD | 6.5628805e-05 |
| 13,576 | Weighted Coverage based Reviewer Assignment | 2015 | SIGMOD | - |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,972 | A Distributed Algorithm for Large-Scale Generalized Matching | 2013 | VLDB |
| 2 | 5,465 | On Obtaining Stable Rankings | 2019 | VLDB |
| 3 | 11,419 | Equitable Top-k Results for Long Tail Data | 2023 | SIGMOD |
| 4 | 9,597 | Dynamic Pricing in Spatial Crowdsourcing: A Matching-Based Approach | 2018 | SIGMOD |
| 5 | 5,441 | Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games | 2024 | SIGMOD |
| 6 | 6,272 | On Shapley Value in Data Assemblage Under Independent Utility | 2022 | VLDB |
| 7 | 11,692 | Optimizing Bipartite Matching in Real-World Applications by Incremental Cost Computation | 2021 | VLDB |
| 8 | 9,220 | Satisfying Complex Top-k Fairness Constraints by Preference Substitutions | 2023 | VLDB |
| 9 | 10,421 | A Game Theory Approach for Negotiating in Data Marketplaces | 2026 | SIGMOD |
| 10 | 12,544 | A Fair Assignment Algorithm for Multiple Preference Queries | 2009 | VLDB |