A Fair Assignment Algorithm for Multiple Preference Queries
Consider an internship assignment system, where at the end of each academic year, interested university students search and apply for available positions, based on their preferences (e.g., nature of the job, salary, office location, etc). In a variety of facility, task or position assignment context...
Saved in:
Main Authors: | U, Leong Hou, Mamoulis, Nikos, Mouratidis, Kyriakos |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2009
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/873 https://ink.library.smu.edu.sg/context/sis_research/article/1872/viewcontent/VLDB09_20__20Preference_20Assignment.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Continuous Spatial Assignment of Moving Users
by: LEONG, Hou U, et al.
Published: (2010) -
Capacity Constrained Assignment in Spatial Databases
by: LEONG, Hou U, et al.
Published: (2008) -
Efficient Evaluation of Multiple Preference Queries
by: LEONG, Hou U, et al.
Published: (2009) -
Optimal Matching between Spatial Datasets under Capacity Constraints
by: LEONG, Hou U, et al.
Published: (2010) -
New algorithm for a multiclass dynamic traffic assignment model
by: Ran, B., et al.
Published: (2014)