Database Paper Browser

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
9972
Venue
VLDB
Year
2009
Pagerank
4.1945683e-05
Overall Rank
12,351 | 14.08%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

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