METHOD AND SYSTEM FOR DYNAMIC SOCIAL NETWORKING BASED ON SIMILAR TRAVEL ITINERARIES
In one embodiment, a method that can be performed on a system, is provided for dynamic social networking based on similar travel itineraries. In one embodiment, the method comprises identifying a set of travel options selected in relation to a travel itinerary of a first traveler; searching a set of travel options previously reserved for travel itineraries of separate additional travelers, to determine if one or more of the travel options selected by the first traveler match one or more of the travel options selected by one or more of the separate additional travelers, based on a predetermined matching criteria; and in response to identifying a match between one or more of the travel options selected by the first traveler and one or more travel options selected by one of the separate additional travelers, sending an invitation for a meeting between the first traveler and one or more of the additional travelers.
1 ) A method comprising:
identifying a set of travel options selected in relation to a travel itinerary of a first traveler;
Searching a set of travel options previously reserved for travel itineraries of separate additional travelers, to determine if one or more of the travel options selected by the first traveler match one or more of the travel options selected by one or more of the separate additional travelers, based on a predetermined matching criteria; and
In response to identifying a match between one or more of the travel options selected by the first traveler and one or more travel options selected by one of the separate additional travelers, sending an invitation for a meeting between the first traveler and one or more of the additional travelers.
2 ) The method of claim 1 , wherein prior to sending the invitation, prompting whether the first traveler chooses to have the invitation sent.
3 ) The method of claim 2 , wherein the one or more additional travelers are anonymous to the first traveler.
4 ) The method of claim 2 , wherein the first traveler is anonymous to the one or more additional travelers.
5 ) The method of claim 1 , wherein the predetermined matching criteria includes a set of rules excluding pre-identified persons from receiving invitations to meet with the first traveler.
6 ) The method of claim 1 , wherein the predetermined matching criteria includes a set of rules excluding persons identified as related to a pre-identified entity, from receiving invitations to meet with the first traveler.
7 ) The method of claim 1 , wherein the meeting of the invitation, is to occur relation an identified match between one or more of the travel options selected by the first traveler and one or more travel options selected by one of the additional travelers.
8 ) The method of claim 1 , wherein the sending of the invitation includes sending the invitation to at least one of the additional travelers and receiving an acceptance to the invitation prior to sending the invitation the first traveler.
9 ) The method of claim 1 , wherein the sending of the invitation includes sending the invitation to the first traveler and receiving an acceptance to the invitation prior to sending the invitation to least one of the additional travelers.
10 ) The method of claim 8 , wherein in response to receiving a decline of the invitation, presenting to the first traveler a message of no match was identified.
11 ) A machine readable medium having stored thereon a set of instructions which when executed perform a method comprising:
identifying a set of travel options selected in relation to a travel itinerary of a first traveler;
Searching a set of travel options previously reserved for travel itineraries of separate additional travelers, to determine if one or more of the travel options selected by the first traveler match one or more of the travel options selected by one or more of the separate additional travelers, based on a predetermined matching criteria; and
In response to identifying a match between one or more of the travel options selected by the first traveler and one or more travel options selected by one of the separate additional travelers, sending an invitation for a meeting between the first traveler and one or more of the additional travelers.
12 ) The machine readable medium of claim 11 , wherein prior to sending the invitation, prompting whether the first traveler chooses to have the invitation sent.
13 ) The machine readable medium of claim 12 , wherein the one or more additional travelers are anonymous to the first traveler.
14 ) The machine readable medium of claim 12 , wherein the first traveler is anonymous to the one or more additional travelers.
15 ) The machine readable medium of claim 11 , wherein the predetermined matching criteria includes a set of rules excluding pre-identified persons from receiving invitations to meet with the first traveler.
16 ) The machine readable medium of claim 11 , wherein the predetermined matching criteria includes a set of rules excluding persons identified as related to a pre-identified entity, from receiving invitations to meet with the first traveler.
17 ) The machine readable medium of claim 11 , wherein the meeting of the invitation, is to occur relation an identified match between one or more of the travel options selected by the first traveler and one or more travel options selected by one of the additional travelers.
18 ) The machine readable medium of claim 11 , wherein the sending of the invitation includes sending the invitation to at least one of the additional travelers and receiving an acceptance to the invitation prior to sending the invitation the first traveler.
19 ) The machine readable medium of claim 11 , wherein the sending of the invitation includes sending the invitation to the first traveler and receiving an acceptance to the invitation prior to sending the invitation to least one of the additional travelers.
20 ) The machine readable medium of claim 18 , wherein in response to receiving a decline of the invitation, presenting to the first traveler a message of no match was identified.