# US 2021/0279650 A1 · Methods and systems for managing simultaneous events

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0279650 A1
- Document ID: US20210279650A1
- Status: Published application
- Kind: A1
- Application number: 17/206,206
- Filed: 2021-03-19
- Published: 2021-09-09
- Earliest claimed: 2013-12-02
- Inventors: JOSHUA CHRISTOPHER JOACHIM
- Web page: https://patentgrep.com/patent/US20210279650A1

## CPC

- G06Q 10/02: Reservations, e.g. for tickets, services or events
- G06Q 10/42: Determination of affinities or common interests between users
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

Embodiments disclosed herein provide systems and methods for a crowd-funding server for users to pledge to purchase tickets to an event based on a number of users that have pledged to purchase tickets for an event and the gender ratio of the users that have pledged to purchase the tickets for the event.

## Claims

### Claim 1

(canceled)

### Claim 2

A computer-implemented method comprising:
receiving, by one or more processors of a crowdfunding system, from a plurality of venue computing devices, venue information and event information maintaining a group-event sex count graph for groups and events of a crowdfunding network, the group-event sex count graph including connections between groups and events, each type of connection based on an action performed by each member of the social network, wherein at least some of the different types of connections include an event pledge;
receiving, by one or more processors of a crowdfunding system, a request from a first member of a first group of the crowdfunding network to identify candidate events, from the events on the crowdfunding network;
identifying, from the crowdfunding network, a set of candidate events;
populating user's graphical user interfaces with event information about the set of candidate events selected for the first member;
receiving, from a plurality of user graphical user interfaces, mutually exclusive, atomic pledge requests for one or more events concurrently from multiple groups on the crowdfunding network, indicating that if the event books they would like to be charged the ticket price and attend the event, and indicating that if the event books all remaining pledges of the group will be deleted;
determining by the crowdfunding service whether to book the event, when processing pledge requests;
processing a multitude of pledges concurrently by a multitude of processes/threads;
ensuring that the result of processing a multitude of pledges concurrently is equivalent to that of which if it was processed serially, and ensuring no race condition bugs, by utilizing a critical section;
indicating, if an event gets booked, on the graphical user interface of users on a list of the booked event that they have successfully booked an event;
utilizing event's connections with one another via mutually exclusive pledges to reduce contention between processes/threads that are concurrently processing pledges;
automatically deleting pledges when an event books.

### Claim 3 (depends on 1)

The computer-implemented of claim 1, further comprising:
automatically removing one or more groups from the list and putting them on a waitlist, and automatically removing one or more groups from the waitlist and putting them on the list, in order to book a bookable-but-stuck event.