Patent ID: 11907303
Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
Field: Computer technology (Electrical engineering)
Classification: CPC G | IPC G

Claim 9:
10. An apparatus, comprising:
at least one processor; and
a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code comprising:
computer readable program code configured to receive, at a job candidate acquisition collaboration system and from each of a plurality of job candidate matching agents, a ranked listing of a plurality of candidates for an open position, wherein each of the ranked listings comprises candidate profiles for a job, wherein each of the plurality of job candidate matching agents corresponds to a system that finds job candidates for the open position;
within a first one of a plurality of collaboration rounds within a collaborative environment within the job candidate acquisition collaboration system, wherein each of the plurality of collaboration rounds is a collaborative ranking round among the plurality of job candidate matching agents, wherein each of the plurality of j ob candidate matching agents has a corresponding ranking algorithm for ranking job candidates:
computer readable program code configured to (i) aggregate the ranked listings into an overall listing, (ii) present the overall listing to a first one of the job candidate matching agents, and (iii) receive at least one modification to the overall listing from the first one of the agents, the at least one modification identified using the ranking algorithm of the first one of the job candidate matching agents;
computer readable program code configured to reorder, by the job candidate acquisition collaboration system, the plurality of candidates based upon the at least one modification; and
computer readable program code configured to, in an analogous fashion, (iv) present, in turn, a version of the overall listing to each of the remaining job candidate matching agents, wherein a version presented to an agent comprises a version of the overall listing being reordered based upon the at least one modification received by an agent having the preceding turn within the collaborative ranking round and (v) receiving any modifications from the agents and reordering the plurality of candidates after a turn of each of the agents until all of the agents have had a turn, wherein the modifications are identified using the ranking algorithm corresponding to each of the remaining job candidate matching agents, wherein each of the ranking algorithms utilizes a ranking of the plurality of candidates on the presented version of the overall listing to weight each of the plurality of candidates when generating the modifications, wherein a weight of rankings of the plurality of candidates within a modification provided by each of the job candidate matching agents is adjusted utilizing at one coefficient comprising a selfishness coefficient, wherein a higher selfishness coefficient of one of the job candidate matching agents results in a lower weight of the rankings provided by the job candidate matching agents;

computer readable program code configured to iteratively conduct, within the collaborative environment and until a final version of the overall listing is reached, others of the plurality of collaboration rounds, wherein the final version is identified when the agents make no modifications to a version of the overall listing presented at the beginning of one of the plurality of collaboration rounds, wherein, within each of the others of the plurality of collaboration rounds, the job candidate acquisition collaboration system comprises:
computer readable program code configured to (i) present a version of the overall listing corresponding to a version generated, by the job candidate acquisition collaboration system, from modifications received by the final job candidate matching agent in a previous round, to the first one of the agents and (ii) receiving any modifications from the first one of the agents, the any modifications identified using the ranking algorithm of the first one of the agents;
computer readable program code configured to reorder, by the job candidate acquisition collaboration system, the plurality of candidates based upon the any modifications; and
computer readable program code configured to, in an analogous fashion, (iii) present, in turn, a version of the overall listing to each of the remaining job candidate matching agents, wherein a version presented to an agent comprises a version of the overall listing being reordered based upon the any modifications received by an agent having the preceding turn within the collaborative ranking round and (iv) receiving any modifications from the agents and reordering the plurality of candidates after a turn of each of the agents until all of the agents have had a turn, wherein the modifications are identified using the ranking algorithm corresponding to each of the remaining job candidate matching agents, wherein each of the ranking algorithms utilizes a ranking of the plurality of candidates on the presented version of the overall listing to weight each of the plurality of candidates when generating the modifications, wherein a weight of rankings of the plurality of candidates within a modification provided by each of the job candidate matching agents is adjusted utilizing at one coefficient comprising a selfishness coefficient, wherein a higher selfishness coefficient of one of the job candidate matching agents results in a lower weight of the rankings provided by the job candidate matching agents; and
computer readable program code configured to provide, within the job candidate acquisition collaboration system, the final version to a user.