US2014100898A1PendingUtilityA1
Order Queue Management in Event Ticket Network Systems
Est. expiryDec 14, 2031(~5.4 yrs left)· nominal 20-yr term from priority
G06Q 10/02G06Q 30/00
63
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
In particular embodiments, a method includes receiving a request to purchase tickets for an event from a user, and associating the request with a queue workflow or a termination workflow based on an application of a probabilistic model, where the inputs to the probabilistic model may include the number of tickets requested by the user, the total number of tickets that other users are requesting to purchase, and the current number of tickets available for the event.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . A method comprising, by one or more processors associated with one or more computing devices:
receiving, by one or more of the processors, a first request to purchase a first number of tickets for an event from a first user; determining, by one or more of the processors, an order success probability for purchasing the first number of tickets for the event using a probabilistic model; and allowing, by one or more of the processors, the first user to purchase the first number of tickets if the order success probability is above a threshold probability.
2 . The method of claim 1 , wherein allowing the first user to purchase the first number of tickets if the order success probability is above the threshold probability comprises associating the first request with a queue workflow.
3 . The method of claim 1 , further comprising:
not allowing the first user to purchase the first number of tickets if the order success probability is below the threshold probability.
4 . The method of claim 3 , wherein not allowing the first user to purchase the first number of tickets if the order success probability is below the threshold probability comprises associating the first request with a termination workflow.
5 . The method of claim 1 , wherein the inputs to the probabilistic model comprise:
the first number of tickets (n1); a total number of tickets for the event that r second requests from r second users, respectively, are requesting to purchase; and a current number of tickets available for the event (T).
6 . The method of claim 5 , further comprising:
if the probabilistic model returns a likelihood of success for purchasing n1 tickets above the threshold probability, then associating the first request with the queue workflow; else associating the first request with the termination workflow.
7 . The method of claim 1 , wherein if a number of open in-process workflows is greater than zero, then associating the first request with an open in-process workflow.
8 . The method of claim 7 , wherein the number of open in-process workflows is equal to a process limit minus a number of second requests associated with an in-process workflow.
9 . The method of claim 7 , further comprising:
if associating the first request with the in-process workflow, then decrementing the number of open in-process workflows.
10 . The method of claim 7 , further comprising:
if associating the first request to the in-process workflow, then transmitting ticket purchase information to the first user.
11 . The method of claim 1 , further comprising:
accessing r second requests from r second users, respectively, wherein each second request is to purchase n2 tickets for the event and each second request is associated with an in-process workflow or a queue workflow; determining a second order success probability (p2) for each second request; and wherein allowing the first user to purchase the first number of tickets if the order success probability is above the threshold probability comprises allowing the first user to purchase the first number of tickets if
(
∑
i
=
0
i
≤
r
p
2
i
·
n
2
i
)
+
(
p
1
·
n
1
)
≤
T
+
ɛ
,
and wherein:
n1 is the first number of tickets;
p1 is order success probability for purchasing the first number of tickets;
T is a current number of tickets available for the event; and
ε is a user-defined threshold.
12 . The method of claim 11 , further comprising:
not allowing the first user to purchase the first number of tickets if
(
∑
i
=
0
i
≤
r
p
2
i
·
n
2
i
)
+
(
p
1
·
n
1
)
>
T
+
ɛ
.
13 . The method of claim 11 , further comprising:
periodically updating one or more of the current number of tickets available for the event, the number of open in-process workflows, the first order success probability, or the second order success probability.
14 . The method of claim 11 , wherein the second order success probability for each second request is based on a duration that the second request has been associated with the in-process workflow or the queue workflow.
15 . The method of claim 14 , wherein the second order success probability for each second request is further based on one or more of an event information for the event or an user information for the second user corresponding to the second request.
16 . The method of claim 11 , wherein p2 i =1−exp(−λ·t i ), wherein t i is a duration that the second request has been associated with the queue workflow.
17 . An apparatus comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to:
receive a first request to purchase a first number of tickets for an event from a first user; determine an order success probability for purchasing the first number of tickets for the event using a probabilistic model; and allow the first user to purchase the first number of tickets if the order success probability is above a threshold probability.
18 . One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
receive a first request to purchase a first number of tickets for an event from a first user; determine an order success probability for purchasing the first number of tickets for the event using a probabilistic model; and allow the first user to purchase the first number of tickets if the order success probability is above a threshold probability.Cited by (0)
No later patents cite this yet.
References (0)
No backward citations on record.