Spatial Two-Sided Online Bottleneck Matching With Deadlines
نویسندگان
چکیده
منابع مشابه
Online Two-sided Bipartite Matching
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...
متن کاملOnline Bottleneck Matching
We consider the online bottleneck matching problem, where k serververtices lie in a metric space and k request-vertices that arrive over time each must immediately be permanently assigned to a server-vertex. The goal is to minimize the maximum distance between any request and its server. Because no algorithm can have a competitive ratio better thanO(k) for this problem, we use resource augmenta...
متن کاملTwo-sided matching with indifferences
Most of the two-sided matching literature maintains the assumption that agents are never indifferent between any two members of the opposite side. In practice, however, ties in preferences arise naturally and are widespread. Market design needs to handle ties carefully, because in the presence of indifferences, stability no longer implies Pareto efficiency, and the deferred acceptance algorithm...
متن کاملBalanced Two-sided Matching
In two-sided matching problem, there are overwhelming evidences that support peoples are also motivated by concerns for fairness and reciprocity. We will show that compromise which is individually irrational improves the welfare of the whole groups. The reasonable compromise level is obtained as the function of the size of the group so that the social utility should be maximized.
متن کاملTwo-Sided Matching with Common Values
This note introduces and studies two-sided matching with incomplete information and common values. An impossibility result shows that even with full information about one side’s values, there exists no detail-free stable incentive compatible matching mechanism.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2982423