Event ticketing in online social networks

One or more computer-readable non-transitory storage media embodying software that is operable when executed to:

• identify an event corresponding to an event node of a social graph associated with a social-networking system, wherein the social graph comprises a plurality of nodes and a plurality of edges connecting the nodes, and the event node is connected to a plurality of ticket nodes corresponding to tickets for the event, the nodes comprising:
• a first user node corresponding to a first user of the social-networking system;
• and
• a plurality of second nodes each corresponding to a concept or to one of a plurality of second users of the social-networking system;
• receive a request to assign a selected one of the tickets for the event to the first user;
• and
• in response to receiving the request to assign the selected ticket, create an edge between the first user node and a selected one of the ticket nodes, wherein the selected ticket node corresponds to the selected ticket, and wherein the edge comprises a data object corresponding to a relationship between the first user node and the selected ticket node, the relationship indicating that the selected ticket is owned by the first user;
• generate a machine-readable ticket code comprising a hash value based on a combination of an identifier for the first user node and an identifier for the selected ticket node;
• send the machine-readable ticket code to a client system associated with the first user;
• receive the machine-readable ticket code from a computer system associated with a point of redemption;
• and
• validate the machine-readable ticket code by retrieving the identifier for the first user node and the identifier for the selected ticket node from the hash value and determining that the edge connecting the first user node and the selected ticket node exists in the social graph.

A system comprising:

• one or more processors;
• and
• a memory coupled to the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to:
• identify an event corresponding to an event node of a social graph associated with a social-networking system, wherein the social graph comprises a plurality of nodes and a plurality of edges connecting the nodes, and the event node is connected to a plurality of ticket nodes corresponding to tickets for the event, the nodes comprising:
• a first user node corresponding to a first user of the social-networking system;
• and
• a plurality of second nodes each corresponding to a concept or to one of a plurality of second users of the social-networking system;
• receive a request to assign a selected one of the tickets for the event to the first user;
• and
• in response to receiving the request to assign the selected ticket, create an edge between the first user node and a selected one of the ticket nodes, wherein the selected ticket node corresponds to the selected ticket, and wherein the edge comprises a data object corresponding to a relationship between the first user node and the selected ticket node, the relationship indicating that the selected ticket is owned by the first user;
• generate a machine-readable ticket code comprising a hash value based on a combination of an identifier for the first user node and an identifier for the selected ticket node;
• send the machine-readable ticket code to a client system associated with the first user;
• receive the machine-readable ticket code from a computer system associated with a point of redemption;
• and
• validate the machine-readable ticket code by retrieving the identifier for the first user node and the identifier for the selected ticket node from the hash value and determining that the edge connecting the first user node and the selected ticket node exists in the social graph.