Method for assigning random pairings to data entries

• US 20050108182A1
• Filed: 12/14/2004
• Published: 05/19/2005
• Est. Priority Date: 03/27/2000
• Status: Active Grant

• Current Assignee: David R. Roberts
• Original Assignee: David R. Roberts
• Inventors: Roberts, David R.
• Granted Patent: US 8,051,184 B2
• Time in Patent Office: Days
• US Class Current: 706/46
• CPC Class Codes: G06Q 10/04 Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" market predictions or forecasting for commercial activities G06Q30/0202
• CPC Class Codes: G06Q 50/01 Social networking

Abstract

A method for pairing elements of a first set of elements {x(i)} with elements from a second set of elements {y(j)} subject to a plurality of pairing restrictions. In accordance with one embodiment of the method, for each of a plurality of iterations of the method, or until a set of pairings is found that satisfies the plurality of pairing restrictions, a random set of pairings between elements of the second set of elements and elements of the second set of elements is selected. The set of mismatched pairings is identified and, if the number of pairings in the set of mismatched pairings is not greater than a maximum number, pairings in the set of mismatched pairings are interchanged. If the number of pairings in the set of mismatched pairings is greater than one, each mismatched pairing is swapped with another pairing if the resulting pairings satisfy the plurality of pairing restrictions.

Claims

1. A computer method for pairing elements of a first set of elements {x(i)} with elements from a second set of elements [y(j)}, where i and j are indices, subject to a plurality of pairing restrictions, the method comprising:

for each of a plurality of iterations or until a set of pairings is found that satisfies the plurality of pairing restrictions;

selecting a random set of pairings between elements of the first set of elements and elements of the second set of elements;

identifying a set of mismatched pairings, from the random set of pairings, that do not satisfy the plurality of pairing restrictions;

if the number of pairings in the set of mismatched pairings is greater than one and not greater than a maximum number of mismatched pairings;

interchanging pairings in the set of mismatched pairings;

if the number of pairings in the set of mismatched pairings is greater than one;

swapping each mismatched pairing with another pairing if the resulting pairings satisfy the plurality of pairing restrictions; and

if there are no mismatched pairings;

providing a list of paired elements to the user.

2. A method in accordance with claim 1, wherein interchanging pairings in the set of mismatched pairings comprises:

interchanging pairings in the set of mismatched pairings if the resulting pairings satisfy the plurality of pairing restrictions.

3. A method in accordance with claim 1, wherein interchanging pairings in the set of mismatched pairings comprises:

interchanging pairings in the set of mismatched pairings if the resulting pairings reduce the number of pairings that do not satisfy the plurality of pairing restrictions.

4. A method in accordance with claim 1, wherein swapping each mismatched pairing with another pairing comprises:

selecting a mismatched pairing [x(i),y(j)];

selecting a second pairing [x(k),y(l)]; and

replacing the pairings [x(i),y(j)] and [x(k),y(l)] with the pairings [x(i),y(l)] and [x(k),y(j)] if the pairings [x(i),y(l)] and [x(k),y(j)] satisfy the plurality of restriction requirements.

5. A method in accordance with claim 1, wherein swapping each mismatched pairing with another pairing comprises:

selecting a mismatched pairing [x(i),y(j)];

selecting a second pairing [x(k),y(l)];

selecting a third pairing [x(m),y(n)]; and

if the pairings [x(i),y(l)], [x(k),y(n)] and [x(m)y(j)] satisfy the plurality of restriction requirements;

replacing the pairings [x(i),y(j)], [x(k)y(l)] and [x(m),y(n)] with the pairings [x(i),y(l)], [x(k),y(n)] and [x(m),y(j)];

else, if the pairings [x(i),y(n)], [x(k)y,(j)] and [x(m),y(l)] satisfy the plurality of restriction requirements;

replacing the pairings [x(i),y(j)], [x(k),y(l)] and [x(m),y(n)] with the pairings [x(i),y(n)], [x(k),y(j)] and [x(m)y(l)].

6. A method in accordance with claim 1, wherein the first set of elements is the same as the second set of elements.

7. A method in accordance with claim 1, wherein the first set of elements comprises a list of names of gift givers, the second set of elements comprises a list of names of gift receivers and the plurality of pairings restrictions comprises a table indicating which giver/receiver pairings are prohibited.

8. A method in accordance with claim 1, wherein the first set of elements comprises a list of people, the second set of elements comprises a list of tasks and the plurality of pairings restrictions comprises a table indicating which tasks each person is prohibited from performing.

9. A method in accordance with claim 1, wherein swapping each mismatched pairing with another pairing is performed only after a specified minimum number iterations has failed to find set of pairings that satisfies the plurality of pairing restrictions.

10. A method in accordance with claim 1, wherein the method is performed by a programmed processor, further comprising:

presenting a using interface to a user of the programmed processor;

receiving data describing the first set of elements and the plurality of pairing restrictions from the user interface; and

if a set of pairings is found that satisfies the plurality of pairing restrictions;

presenting the set of pairings that satisfies the plurality of pairing restrictions to the user via the user interface.

11. A method in accordance with claim 10, further comprising:

defining the user interface by a web page stored on a network server;

presenting the user interface to the user via the Internet;

receiving data describing the first set of elements and the plurality of pairing restrictions from the user interface via the Internet; and

if a set of pairings is found that satisfies the plurality of pairing restrictions;

presenting the set of pairings that satisfies the plurality of pairing restrictions to the user via the Internet.

12. A computer readable medium storing a plurality of program instructions, which when executed on a computer, perform a method comprising:

selecting a random set of pairings between elements of a first set of elements and elements of a second set of elements;

identifying a set of mismatched pairings, from the random set of pairings, that do not satisfy a plurality of pairing restrictions;

if the number of pairings in the set of mismatched pairings is greater than one and not greater than a maximum number of mismatched pairings;

interchanging pairings in the set of mismatched pairings; and

if the number of pairings in the set of mismatched pairings is greater than one;

swapping each mismatched pairing with another pairing if the resulting pairings satisfy the plurality of pairing restrictions.

13. A computer readable medium in accordance with claim 12, wherein the interchange of pairings in the set of mismatched pairings is performed if the resulting pairings satisfy the plurality of pairing restrictions.

14. A computer readable medium in accordance with claim 12, wherein the interchange of pairings in the set of mismatched pairings is performed if the resulting pairings reduce the number of pairings that do not satisfy the plurality of pairing restrictions.

15. A computer readable medium in accordance with claim 12, wherein the swapping of each mismatched pairing with another pairing if the resulting pairings satisfy the plurality of pairing restrictions comprises:

selecting a mismatched pairing [x(i),y(j)];

selecting a second pairing [x(k),y(l)]; and

replacing the pairings [x(i),y(j)] and [x(k),y(l)] with the pairings [x(i),y(l)] and [x(k),y(j)] if the pairings [x(i),y(l)] and [x(k),y(j)] satisfy the plurality of restriction requirements.

16. A computer readable medium in accordance with claim 12, wherein the swapping of each mismatched pairing with another pairing if the resulting pairings satisfy the plurality of pairing restrictions comprises:

selecting a mismatched pairing [x(i),y(j)];

selecting a second pairing [x(k),y(l)];

selecting a third pairing [x(m),y(n)]; and

if the pairings [x(i),y(l)], [x(k),y(n)] and [x(m),y(j)] satisfy the plurality of restriction requirements;

replacing the pairings [x(i),y(j)], [x(k),y(l)] and [x(m),y(n)] with the pairings [x(i),y(l)], [x(k),y(n)] and [x(m),y(j)];

else, if the pairings [x(i),y(n)], [x(k),y(j)] and [x(m),y(l)] satisfy the plurality of restriction requirements;

replacing the pairings [x(i),y(j)], [x(k),y(l)] and [x(m),y(n)] with the pairings [x(i),y(n)], [x(k),y(j)] and [x(m),y(l)].

17. A computer readable medium in accordance with claim 12, wherein the swapping of each mismatched pairing with another pairing if the resulting pairings satisfy the plurality of pairing restrictions comprises:

interchanging the mismatched pairing and another pairing if the resulting pairings satisfy the plurality of pairing restrictions; and

interchanging the mismatched pairing and two other pairings if the resulting pairings satisfy the plurality of pairing restrictions.

18. A computer readable medium in accordance with claim 12, wherein the first set of elements is the same as the second set of elements.

19. A computer readable medium in accordance with claim 12, wherein the plurality of program instructions are transmitted to a user via the Internet.

20. A computer readable medium in accordance with claim 12, wherein the plurality of program instructions are executed on a network server in response to user instructions transmitted to the server via the Internet.