- Number
- 20230063036
- Published
- 2023-03-02
- Filed
- 2021-09-02
- Assignee
- Disney Enterprises, Inc.
- Inventors
- Batty, III; John Robert et al.
- CPC
- G06F16/24578
- Verdict
- Set aside generic matching/scoring system, business
- Source
- Google Patents · FreePatentsOnline
Abstract
Techniques for dynamic matching include dynamically defining a first set of queries, including defining a plurality of weights for the first set of queries and defining one or more relationships between queries in the first set of queries. A first set of responses are received from a first participant in a first category of participants. A plurality of additional sets of responses are received from a second category of participants. A plurality of recommendation scores are generated, each corresponding to a potential pairing between the first participant and a participant in the second category of participants. Each respective recommendation score is generated based on: i) a comparison of the first set of responses and one of the additional sets of responses, ii) the defined plurality of weights, and iii) the defined one or more relationships. Matches are identified for the first participant based on the plurality of recommendation scores.
Background
BACKGROUND
Dynamic matching between different categories of participants is a challenging problem. Existing solutions typically identify a list of matching candidates for a given participant, and allow a participant to select from among the candidates in another category based on the participant's own criteria. But this is inefficient and burdensome for the participant. SUMMARY
Embodiments include a computer-implemented method. The method includes dynamically defining, using a computer processor, a first set of queries, including: defining a plurality of weights for the first set of queries, and defining one or more relationships between queries in the first set of queries. The method further includes receiving, at the computer processor, a first set of responses to the first set of queries from a first participant in a first category of participants. The method further includes receiving, at the computer processor, a plurality of additional sets of responses to the first set of queries, each additional set of responses being received from one of a plurality of participants in a second category of participants. The second category of participants is distinct from the first category of participants. The method further includes generating, using the computer processor, a plurality of recommendation scores, each respective recommendation score of the plurality of recommendation scores corresponding to a potential pairing between the first participant and one of the
Claims
1. A computer-implemented method, comprising: dynamically defining a first set of queries, comprising defining a plurality of weights for the first set of queries and defining one or more relationships between queries in the first set of queries; dynamically defining matching criteria to account for any responses to the first set of queries; receiving a plurality of responses, the plurality of responses including a first set of responses to the first set of queries from a first participant in a first category of participants and a plurality of additional sets of responses to the first set of queries, each additional set of responses being received from one of a plurality of participants in a second category of participants, wherein the second category of participants is distinct from the first category of participants; after receiving the plurality of responses, dynamically defining a new query; dynamically modifying, using a computer processor, the matching criteria to further account for any responses to the new query; receiving a plurality of new responses to the new query, the plurality of new responses including a new response from the first participant and a new response from one of the plurality of participants; generating a plurality of recommendation scores based on the modified matching criteria, the plurality of responses, and the plurality of new responses, each respective recommendation score of the plurality of recommendation scores corresponding to a potential pairing between the first participant and one of the plurality of participants in the second category of participants; and identifying one or more matches for the first participant, from the plurality of participants in the second category of participants, based on the plurality of recommendation scores. ||
11. A non-transitory computer-readable medium containing computer program code that, when executed by operation of a computer processor, performs an operation comprising: dynamically defining a first set of queries, comprising defining a plurality of weights for the first set of queries and defining one or more relationships between queries in the first set of queries; dynamically defining matching criteria to account for any responses to the first set of queries; receiving a plurality of responses, the plurality of responses including a first set of responses to the first set of queries from a first participant in a first category of participants and a plurality of additional sets of responses to the first set of queries, each additional set of responses being received from one of a plurality of participants in a second category of participants, wherein the second category of participants is distinct from the first category of participants; after receiving the plurality of responses, dynamically defining a new query; dynamically modifying, using a computer processor, the matching criteria to further account for any responses to the new query; receiving a plurality of new responses to the new query, the plurality of new responses including a new response from the first participant and a new response from one of the plurality of participants; generating a plurality of recommendation scores based on the modified matching criteria, the plurality of responses, and the plurality of new responses, each respective recommendation score of the plurality of recommendation scores corresponding to a potential pairing between the first participant and one of the plurality of participants in the second category of participants; and identifying one or more matches for the first participant, from the plurality of participants in the second category of participants, based on the plurality of recommendation scores. ||
17. A system, comprising: a computer processor; and a memory having instructions stored thereon which, when executed on the computer processor, performs an operation comprising: dynamically defining a first set of queries, comprising defining a plurality of weights for the first set of queries and defining one or more relationships between queries in the first set of queries; dynamically defining matching criteria to account for any responses to the first set of queries; receiving a plurality of responses, the plurality of responses including a first set of responses to the first set of queries from a first participant in a first category of participants and a plurality of additional sets of responses to the first set of queries, each additional set of responses being received from one of a plurality of participants in a second category of participants, wherein the second category of participants is distinct from the first category of participants; after receiving the plurality of responses, dynamically defining a new query; dynamically modifying, using a computer processor, the matching criteria to further account for any responses to the new query; receiving a plurality of new responses to the new query, the plurality of new responses including a new response from the first participant and a new response from one of the plurality of participants; generating a plurality of recommendation scores based on the modified matching criteria, the plurality of responses, and the plurality of new responses, each respective recommendation score of the plurality of recommendation scores corresponding to a potential pairing between the first participant and one of the plurality of participants in the second category of participants; and identifying one or more matches for the first participant, from the plurality of participants in the second category of participants, based on the plurality of recommendation scores.