Results 1 to 10 of about 972,187 (291)
Data Acquisition Based on Stable Matching of Bipartite Graph in Cooperative Vehicle–Infrastructure Systems [PDF]
Sensors, 2017 Existing studies on data acquisition in vehicular networks often take the mobile vehicular nodes as data carriers. However, their autonomous movements, limited resources and security risks impact the quality of services.
Xiaolan Tang, Donghui Hong, Wenlong Chen
doaj +2 more sources
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2009 We introduce the {\sc classified stable matching} problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applicants.
Huang, Chien-Chung
core +4 more sources
Logistics-client stable matching under 4PL to reduce the empty-loaded rate. [PDF]
PLoS ONELogistics, as a tertiary industry, has developed rapidly and become an important part of the national economy. However, owing to the behindhand logistics pattern, the logistics vehicles drive empty-loaded on their return trip, resulting in wastage of ...
Jian Jiang, Jie Li, Boyuan Xia
doaj +2 more sources
Maximum Locally Stable Matchings [PDF]
Algorithms, 2013 Motivated by the observation that most companies are more likely to consider job applicants referred by their employees than those who applied on their own, Arcaute and Vassilvitskii modeled a job market that integrates social networks into stable ...
Eric McDermid, Christine T. Cheng
doaj +2 more sources
Procedurally Fair and Stable Matching [PDF]
Economic Theory, 2006 We motivate procedural fairness for matching mechanisms and study two procedurally fair and stable mechanisms: employment by lotto (Aldershof et al., 1999) and the random order mechanism (Roth and Vande Vate, 1990, Ma, 1996).
Bettina Klaus, Flip Klijn
core +8 more sources
Understanding Popular Matchings via Stable Matchings [PDF]
SIAM Journal on Discrete Mathematics, 2022 Let $G = (A \cup B, E)$ be an instance of the stable marriage problem with strict preference lists. A matching $M$ is popular in $G$ if $M$ does not lose a head-to-head election against any matching where vertices are voters. Every stable matching is a min-size popular matching; another subclass of popular matchings that always exist and can be easily ...
Ágnes Cseh +3 more
openaire +5 more sources
An approximate search algorithm for the student-internship allocation problem
Tạp chí Khoa học, 2022 This paper proposes an approximate search algorithm to solve the student-internship allocation problem. The key idea of the algorithm is that in each iteration, each student unassigned to an enterprise will be assigned to an enterprise where the student
NGUYEN Quang Ninh +2 more
doaj +1 more source
Games and Economic Behavior, 2023 In this paper we consider the issue of a unique prediction in one to one two sided matching markets, as defined by Gale and Shapley (1962), and we prove the following. Theorem. Let P be a one-to-one two-sided matching market and let P be its associated normal form, a (weakly) smaller matching market with the same set of stable matchings, that can be ...
Gregory Z. Gutin +2 more
openaire +2 more sources
ISPRS International Journal of Geo-Information, 2022 In this work, we propose a Game Theory-based pricing solution to the ridesharing problem of taxi commuters that addresses the optimal selection of their travel companionship and effectively minimizes their cost.
Elmer Magsino +3 more
doaj +1 more source
Stable fractional matchings [PDF]
Artificial Intelligence, 2019 We study a generalization of the classical stable matching problem that allows for cardinal preferences (as opposed to ordinal) and fractional matchings (as opposed to integral). After observing that, in this cardinal setting, stable fractional matchings can have much higher social welfare than stable integral ones, our goal is to understand the ...
Ioannis Caragiannis +3 more
openaire +7 more sources