DBScholar

Back to papers

A Fair Assignment Algorithm for Multiple Preference Queries

Summary: Fair 1-1 matching of weighted preference queries to objects via a stable-marriage framework, iteratively extracting pairs. Proposes skyline-maintenance with I/O optimality, yielding speedups over prior methods; validated on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10163
Venue
VLDB
Year
2009
Pagerank
5.093636e-05
Overall Rank
12,544 | 13.94%
DOI
10.14778/1687627.1687746

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{u_vldb09,
        title = {{A Fair Assignment Algorithm for Multiple Preference Queries}},
        author = {U, Leong Hou and Mamoulis, Nikos and Mouratidis, Kyriakos},
        journal = {PVLDB},
        series = {{VLDB} '09},
        doi = {10.14778/1687627.1687746},
        url = {https://doi.org/10.14778/1687627.1687746},
        year = {2009}
}

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 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers