Results 11 to 20 of about 3,305 (196)
An efficient implementation of the Gale and Shapley "propose-and-reject" algorithm
We consider a version of the Hospitals/Residents problem which was first defined in 1962 by Gale and Shapley [9] under the name "College Admissions Problem". In particular, we consider the Firms/Candidates problem, where each Firm wishes to hire at least
Nasia Zacharia +2 more
doaj +2 more sources
Almost Stable Matchings by Truncating the Gale–Shapley Algorithm [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patrik Floréen +3 more
openaire +3 more sources
Manipulating Gale-Shapley Algorithm: Preserving Stability and Remaining Inconspicuous [PDF]
We study the problem of manipulation of the men-proposing Gale-Shapley algorithm by a single woman via permutation of her true preference list. Our contribution is threefold: First, we show that the matching induced by an optimal manipulation is stable with respect to the true preferences.
Rohit Vaish, Dinesh Garg
openaire +2 more sources
Asymmetry of Strategies in Proposal: Gale-Shapley Algorithm on Diagrams
AbstractThis paper proposes a new diagram for a specific matching problem: the stable marriage problem. The diagram allows us to elicit not only the structure of with a blocking relation among the nodes representing pairs, but also asymmetry in the actions of the DA algorithm (Gale-Shapley algorithm).
Yoshiteru Ishida, Shigetaka Ikeno
openaire +2 more sources
Performance-based Stable Matching using Gale-Shapley Algorithm [PDF]
Performance is something that will be achieved at the institute. Everyone has different abilities in doing a task. Placement of an office position does not always result in satisfactory performance. Giving an assignment to people who are not qualified in their field will cause problems in the future. This problem arises from the inability of the person
E Elviwani +2 more
core +4 more sources
On algorithm Gale-Shapley and possibilities of its use in extracurricular activities in mathematics
Modern mathematical ideas are quite difficult for even high school students to understand from both a mathematical and terminological point of view. The exception may be an algorithm Gale-Shapley (algorithm for creating persistent pairs), who won the Nobel Prize in 2012 in the brunch of economy. This algorithm is interesting in that it shows the modern
Odintsova O., O., Kudlay A., B.
openaire +3 more sources
Enhancement Of Gale-Shapley algorithm with imbalanced sets for hiring and job finding applications
In this paper, <span>we discuss a modification to the Gale Shapley algorithm in this study. We concentrated on how the modified algorithm would operate if the data sets for men and women were not equal. We showed how to measure the average energies of men and women with equal and unequal sets, how the new design of the algorithm will benefit both
Arnin Aaron D. Mendoza +5 more
openaire +3 more sources
Efficient content caching for 5G assisted vehicular networks [PDF]
Traffic congestion is one of the major challenges faced by daily commuters in smart cities. An autonomous transportation system with a 5 G-based Cellular Vehicle-to-Everything (C-V2X) communication system is the solution to meet the traffic challenges ...
Faareh Ahmed +6 more
doaj +2 more sources
Device-to-Device (D2D) communication is pivotal in enhancing the performance of 5G networks by improving spectral efficiency, reducing latency, and supporting applications such as the Internet of Things (IoT). Despite these benefits, direct communication
Musaad Alruwaili +2 more
doaj +2 more sources
Coalitional permutation manipulations in the Gale-Shapley algorithm [PDF]
In this paper, we consider permutation manipulations by any subset of women in the Gale-Shapley algorithm. This paper is motivated by the college admissions process in China. Our results also answer an open problem on what can be achieved by permutation manipulations.
Weiran Shen, Yuan Deng, Pingzhong Tang
openaire +5 more sources

