Note: Descriptions are shown in the official language in which they were submitted.
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
COMPUTER CONTROLLED EVENT TICKET AUCTIONING SYSTEM
CROSS-REFERENCE TO RELATED APPLICATIONS.
This is a continuation-in-part of application serial No. 08/0862,547 filed May
23, 1997.
BACKGROUND
1. Field of the Invention: The present invention relates to a system that uses
communication lines connecting participants from various locations, such as
personal computers
connected via the Internet, to a central computer which conducts a real-time
auction of tickets to
sporting and entertainment events.
2. Background ofthe Invention: The established method of selling tickets to
sporting
and entertainment events involves pre-setting inflexible prices then releasing
the tickets for sale
at a box office or by phone. This method has a number of shortcomings.
Typically, each sale
involves employees taking time-consuming individual orders and trying to
describe the prices and
seat locations to customers. Another shortcoming with this method is that
especially for premium
events, it can be highly inconvenient and sometimes impossible for the
purchaser to access the
sale due to demand. Moreover, for practical reasons, prices are assigned to
tickets in large blocks,
while, in reality, purchasers often consider tickets within a block to have a
wide ranging
continuum of values; and these market values can be very hard to estimate
before the tickets are
sold. Largely because of these shortcomings, many premium tickets are sold for
substantially less
than their market value. Generally, these shortcomings exist even with new
automated methods
involving phone or Internet sales since the number of tickets is limited and
the selling system is
still fundamentally the same; with "first-come-first-served" orders taken for
pre-priced tickets.
- 1 -
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
Although it is widely known that the market values some tickets at a
substantial premium
over face value, there has been no system available for accurately
establishing and selling these
tickets at their market value. Logistically, auctioning the tickets has not
been feasible due to the
large quantity of unique seats and even larger quantity of buyers wishing to
purchase them.
A few auction systems have been developed that operate using the Internet as
the
communications mode. These systems have been used to auction items such as
computer
equipment, artwork, and special items for charity. However, these systems are
not suitable for
use in connection with a real-time mass auction of event tickets. With the
currently operating
systems, generally the items being sold are of a small quantity or
individually unique. In most
of the currently operating systems, the items for sale are individually
listed, and individually bid
upon using e-mail over a period of days or weeks. While, the currently
operating systems are
useful for such limited purposes, they have several shortcomings.
One such shortcoming arises from the use of e-mail to place bids and to update
participants of their bid status. While in theory e-mail is instantaneous,
there are occasional
routing delays of which the sender is often not immediately aware. In an
auction of a slow,
deliberate nature such as those presently operating, this is not a great
concern. However, in a fast
pace auction with numerous participants some bids could be lost as delayed e-
mail, unbeknownst
to the participant.
An additional problem with the e-mail approach is that time may elapse before
the bid
information is read and applied. Therefore, the participant may not get
instantaneous feedback
on other bids which may be taking place simultaneously. The participant often
must wait for
some period of time to learn if the bid is successful. If the participant has
a strategy for bidding
-2-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
on a very desirable item, the participant must return to the auction numerous
times to follow its
progression.
Most currently operating systems provide some general bid status data, usually
a minimal
amount of information such as "current" high bid. This "current" high bid is
updated by
periodically reviewing the bids received, and entering the highest bid to
date. Therefore, these
"current" bids are not current up to the bids received, and entering the
highest bid to date
Therefore, these "current" bids are not current up to the second. Moreover, if
there are many of
a particular item, especially such as event tickets having a continuum of
values, participants need
to know considerably more than the high bid information in order to make an
informed bidding
decision.
Currently operating systems do not provide bid status information updates
independent
of solicitation of the information from participants. Once the Internet
auction site is accessed, the
information conveyed may become outdated as it is being viewed. Again this
would be quite
unfavorable for fast-paced auctions. Therefore, even with auction sites which
were actually being
updated real-time, a participant would need to continually re-access the site
in order to keep
information truly updated.
One Internet auction system, "onsale" at http://www.onsale.com/ attempts to
overcome
the e-mail auction problems by automatically updating its Internet site.
However, like the other
Internet auction sites, onsale conducts relatively slow, deliberate sales, and
still relies on e-mail
to transmit some of the bid information. In addition, although the onsale
auction site is
automatically updated, it does not automatically present this information to
participants. As
-3-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
explained above, participants need to continually re-access the site in order
to keep information
truly updated.
U.S. patent no. 4,689,928 details an auction system for used cars that is
capable of
interactive, essentially real-time auctioning. Instead of Internet based, this
used car auctioning
system is constructed with a 4 - level hierarchy of computers networked to a
plurality of auto
dealers terminals. At each level, the bids received by the computer are
processed and only select
bids are transmitted to the next level. The bids are raised in increments of
3000 yen and the
participants may bid via a single signal indicating a "yes" in response to the
bid being raised.
This system is based on the traditional auction format, and is used to sell
one item or lot at a time.
When a car has been auctioned, a disc is loaded by each dealer into his
terminal which shows the
photograph of the next car to be auctioned. Bidding is limited to a
predetermined group of auto
dealers. Because the structure of this system is hierarchical, I.e. not on the
Internet, it is not
practical for use in wide-spread auctions available to consumers. Because of
the methodical
nature of this system, selling a progression of single items with incremented
bids, it is geared for
low volume sales of items with relatively high values.
Recently tickets have been made available for purchase on the Internet, for
example at
http.www.ticketmaster.com/ but not in an auction format, as is needed to sell
certain tickets at
their market prices. At this Internet site, sales are of the traditional pre-
set pricing, "first-come-
first-served" format.
Considering the selling of a large number of tickets to an event, there are
unique
circumstances which present challenges not manifested in selling other items.
For example, in
a particular auction, all the tickets may be for the same venue, date, time,
and performance.
-4-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
However, each of these tickets also possesses the very unique characteristic
of seat location. This
characteristic can dramatically effect the ticket value. Ticket values
typically vary widely, yet
in a continuum from closest to farthest from the performance area. Thus. it is
not practical to
mass the tickets into simple generic blocks to be auctioned. Nor is it
practical to list and auction
each ticket individually, since this could present auction participants with a
prohibitively large
number of individual auctions, and no practical way to obtain contiguous
seats. Accordingly,
there exists a need for a system which can, within a single, clear format,
auction a large number
of items with a continuum of values, each at its market price. Furthermore,
this system needs to
apply logic in sorting bids based not only on price, but on clustering
requirements to ensure that
within a multiple-ticket bid, the seats are adjoining. This would require a
database configuration
unlike that employed by the prior art.
Moreover, given the furious pace of sales for many premium tickets, there
exists the
unique and as yet, unmet challenge of providing instant, automatic,
comprehensive feedback for
status of a relatively complex arrangement of standing bids. Frequently the
more popular
sporting and entertainment events sell all available tickets in a matter of a
few minutes. The
number of tickets to these events may reach into the hundreds of thousands. A
practicable
auction of tickets for such an event would require a system uniquely designed
to process this large
volume while presenting an updated, clear and informative view of the
proceedings to all
participants. It would be logical to presume that efficient conveyance of bid
information for a
large, complex pattern of bids would require a graphical representation of the
bid standings.
Although some Internet auctions employ graphical representation of obj ects
for sale, none employ
graphical representation of bid status.
-5-
CA 02399155 2002-07-31
WO 01/59649 PCT/LTS00/03136
Another need for on-line auction systems is a method of convincing bidders to
place their
bids early instead of waiting to bid at the last minute before the auction
closes. As mentioned
previously, on-line auctions are typically conducted over a set period of
time. With these
systems, bidders often wait until the last possible second before auction
closing to place their bids
in an attempt to block subsequent bidders from making higher bids. Such
actions by bidders not
only keeps the price of the auctioned item undesirably low, but sometimes
results in a large
quantity of bids just before auction closing which the on-line system is not
capable of handling.
Thus, it would be advantageous for an on-line auction system that provides
incentives for bidders
to place their bids early in the auction rather than waiting until the last
minute.
In spite of their shortcomings, the above mentioned prior art systems are
useful for their
respective intended purposes. However, given their limitations, and the above
noted unique
circumstances for mass ticket sales, it is simply not practical or feasible to
apply any of the prior
art to the particular task of auctioning a large volume of event tickets.
SUMMARY
Accordingly, an object of the present invention is to provide a computer
controlled
auctioning system, in which an unlimited number of participants may have
simultaneous access
to the desired event tickets. The above stated needs as well as others are
fulfilled by the present
invention through a system constructed to sell a large number of tickets in a
very short time, each
said ticket or group of tickets being sold for a value set by existing market
forces. The system
provides participants with simple, yet informative graphical standing bid
information on the entire
stock of tickets available, and allows them real-time bidding interaction.
This system can achieve
-6-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
such sales even for events of extremely high public interest, without
excluding any potential
purchasers.
The present invention achieves said obj ectives by employing a computer
controlled event
ticket auctioning system which receives and evaluates bid information records
received from a
plurality of remote terminals, said bid information records corresponding to
bids for one or more
seats within a venue and corresponding to at least one particular event, said
venue having a
plurality of sections, each section having a plurality of seats.
The automated event ticket auctioning system is comprised of a memory storing
a
plurality of previously accepted bid information records, said records each
including
identification information, section identification, quantity information, and
bid price information.
The automated event ticket auctioning system is further comprised of a central
controlling
computer operably connected to the memory and operable to receive a message
including a
received bid information record from one of a plurality of remote terminals
through a
communication system, determine a lowest minimum acceptable bid value
corresponding to the
received section information using the previously accepted bid information
records stored in the
memory, and store the received bid information record if a value represented
by the received bid
price information exceeds the lowest minimum acceptable bid value.
The central controlling computer is further operable to, in a like manner,
receive, evaluate
and store if acceptable, subsequent bids received and to stop receiving
subsequent messages after
a predetermined time period.
Within the automated event ticket auctioning system, each previously accepted
bid
information record includes rank information based on the section information
and the bid price
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
information, and the central controlling computer is further operable to
assign a rank to each
received bid information record based on its section identification, its bid
price information, and
the previously accepted bid information records.
After stopping receiving subsequent messages, the central controlling computer
is further
operable to associate one or more particular seats of the venue with a
previously accepted bid
information record based on the rank information and the section information
of each of a
plurality of previously accepted bid information records.
The automated event ticket auctioning system further includes a programmed
graphical
representation method designed to efficiently convey to auction participants
useful standing bid
information across the entire event venue, allowing seat bid price locations
to be quantified in an
effective manner.
The system further includes programmed methods for ensuring contiguous
grouping of
seat location within each multiple ticket bid, and for ensuring that the
standing bid information
is automatically updated on a real-time basis and presented as such to all
auction participants; said
programmed method employing HTML programming features such as the recently
available
META refresh (a client pull type browser directive) or the multipart/mixed
MIME format (a
server push type browser directive).
Participants may access this system from remote sites using terminals such as
personal
computers, via telephone lines or other means of communication. The status of
bids and seat
locations are conveyed on graphic displays of the venue seating arrangement
which are updated
on a real-time basis for all participants to view. Participants may place bids
of any amount,
subject to pre-determined limits, and cancel, raise, or lower bids at will. In
addition, participants
_g_
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
may view their personal bid standings and the updated overall bid standings
without having to
continually re-access the auction site. Through the participants' remote
terminals, the personal
bid requests are sent to the host computer which immediately processes, and
sorts the bids
according to section and price. The central computer immediately updates and
displays the new
bid standing order. When the auction is closed, the bids become fixed and the
physical
transaction can occur.
The system further includes the ability for participants to limit their bids
to particular
types of seats such as front row seats or aisle seats. Additionally, the
system will allow
participants to lock-in their seats before auction closing upon the payment of
a premium. Also,
the system provides for proxy bidding which allows participants to
automatically increase bid
amounts to match subsequent higher bids. The system also provides incentives
for compelling
bidders to place bids well in advance of auction closing.
BRIEF DESCRIPTION OF THE DIAGRAMS
FIG. 1. is a block diagram of an exemplary system built in accordance with the
present invention.
FIG. 2. is a flowchart illustrating an exemplary system built in accordance
with the present
invention.
FIG. 3. is a flowchart illustrating an exemplary participant registration
procedure used in a system
built in accordance with the present invention.
-9-
CA 02399155 2002-07-31
WO 01/59649 PCT/CTS00/03136
FIG. 4. is a flowchart illustrating an exemplary auction procedure used in a
system built in
accordance with the present invention.
FIG. 5. is an exemplary representation of the main auction database storing
the order of bids
received.
S FIG. 6. 6 is an exemplary representation of a refernng database which stores
the seating
arrangements and available tickets for sale.
FIG. 7. is an exemplary representation of a referring database which stores
the participants
identity and personal and payment information.
FIG. 8. is an example of the statistical record of all bid events received:
for use in marketing
studies and customer service.
FIG. 9. is an example of the participant's terminal screen, as it might appear
before the beginning
of an auction. The terminal displays a graphical representation of the venue
of seats to be
auctioned and the preset minimum bid price of those seats.
FIG. 10. is an example of the participant's terminal screen, as it might
appear during an auction.
The terminal displays a graphical representation of the venue of seats to be
auctioned, the present
bid price of those seats, and the personal bid standing for this particular
participant.
- 10-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
FIG. 11. is an example of the participant's terminal screen when the desired
section is chosen for
bidding. The bid form is included on this screen.
FIG. 12. is a flowchart illustrating an exemplary algorithm used to ensure
contiguous seats within
each bid in a system built in accordance with the present invention.
FIG. 13. is a flowchart illustrating an exemplary algorithm used to match the
number of available
seats with the number of seats requested by winning bidders in a system built
in accordance with
the present invention.
FIG. 14 is an example ofthe participant's terminal screen requesting further
information from the
participant about participant preferences.
FIG.15 is an example of the participant's terminal screen showing a bidding
activity meter during
open bidding.
FIG. 16 is an example of the participant's terminal screen showing the bidding
activity meter of
Fig. 1 S after bidding is closed.
1 S DESCRIPTION
FIG 1. shows a computer controlled auctioning system 10 which is built
according to the
present invention. As, shown, the computer controlled auctioning system 10 is
comprised of a
central computer 12 such as an Internet server which sends and receives
information through a
communication system 13 such as the public telephone system, television cable
system, or
satellite communications system to remote terminals 14,,142, 143....... 14",
such as personal
computers or other network accessing devices. In this embodiment, Internet
sites are constructed
-11-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
consisting of web pages of graphics and text stored as html files, which
present the necessary
information pertaining to upcoming events and ticket sales. These sites are
stored in the memory
of the central computer 12. The construction and initiation of these sites is
shown as step 22 and
step 23 in FIG. 2, which is a flowchart illustrating the general operation of
this exemplary system.
Accordingly, consumers wishing to become participants (also referred to herein
as
"bidders") in an upcoming auction may access the central computer 12 of FIG. 1
through any
remote terminal 14,,142, 143....... 14" to receive a wide variety of
information about the auctions,
the related events, venues, performers or teams, schedules, and merchandise;
and to pre-register
for the auction and payment. The registration process is represented as step
24 in FIG. 2. Next,
as FIG 2 illustrates, the auction operation 25 is executed; the transactions
26 take place, and the
system is ended 27. These steps are described in more detail below.
Refernng again to FIG. 1, registration and bid information originating in the
remote
terminals 14,,14,, 143....... 14", is transferred via the communication system
13 and received by
the central computer 12. The central computer 12 processes said information
and stores it in
databases: specifically, the participant database 15 for registrations and the
main auction database
16 for bids. The word database, as used herein, and in the appended claims is
intended to refer
to a collection of information organized in such a way that the central
computer can quickly select
and store desired pieces of data within the database. The information in the
database may be
stored in any of several ways, including, but not limited to, magnetic
storage, optical storage, or
any other form of storage known in the art. The central computerl2 also
performs sorting and
indexing operations, described below, necessary to keep the information in the
databases current
and correctly ordered. The central computer 12 processes and controls the
information flowing
-12-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
between the Internet sites and the databases with programming written in C++
language.
Registration information may be received and stored before and during
operation of the auction.
The participant database, represented by FIG. 7 contains the name, address,
and payment
information for all participants, and is used as a referring database to the
main auction database,
represented by FIG. 5, during the open auction and for billing purposes when
the auction is
concluded. FIG. 5 and FIG. 7 are detailed below.
Refernng again to FIG. 1, a master computer 11 is connected to the central
computer 12
for purposes of setting up, initiating, monitoring and dismantling the
auction, and its related sites
or pages. For example, in preparation for an auction, numerous details
specific to that auction,
such as minimum initial bids, event and sponsor names, dates and times, and
seating
arrangements are generated using the master computer 11 and then transferred
by disk or modem
or other means to the central computer 12 when needed. The central computer 12
stores these
parameters for later application to the auction process. In particular, the
central computer 12
stores in the seating database 17, the specific seating arrangement as a
unique record for each seat
available. The auction is then conducted by the central computer 12, as
described below. During
the auction, the master computer 11 can be used to monitor the auction
progress, make any
necessary spontaneous changes to existing parameters, and to generally ensure
that the auction
is conducted with a minimum of problems. In practice, it may be possible to
combine the
functions of the central computer 12 and the Master computer 11.
Step 24 in FIG. 2 is illustrated in detail by FIG. 3, an exemplary participant
registration
flowchart. The potential registrant begins in step 28 by interfacing with one
of the terminals, for
example, terminal 14,, of FIG. 1. When the rules and registration Internet
site is accessed at step
-13-
CA 02399155 2002-07-31
WO 01/59649 PCT/LTS00/03136
29 of FIG. 3, the registrant is encouraged to read the auction rules
thoroughly, and agree to their
terms. This site includes a registration form which will contain that
registrant's personal
information including records for the fields illustrated in the participant
database of FIG. 7, as
well as a checkbox for agreement to the terms of the auction rules, and a
password, if desired to
protect access. The password may be chosen for use when accessing the auction,
in lieu of re-
entering the credit card number. This allows the participant to have an agent
place bids, without
disclosing the credit card number.
The central computer 12 of FIG.1 performs all remaining steps in this
registration process
depicted in FIG. 3. In step 30, of FIG. 3, the registration information is
received and in step 31,
a determination is made as to whether the information is satisfactorily
complete. If not, a
message to that effect is sent in step 32 back to the registrant, and the
registration process is ended
at step 39. If the registration information is satisfactorily complete, then
in step 33, the credit
information is obtained through existing credit card systems for comparison to
the information
given by the registrant. In step 34, said comparison is performed and if the
credit information
does not match or the limit is exceeded, a message to that effect is sent in
step 35 back to the
registrant, and the registration process is ended at step 39. If in step 34
the card is determined to
be valid and the limit not to be exceeded, then in step 36, an 'authorization
only' hold is placed
on the registrant's credit card, for an amount specified by the participant.
This limit, also stored
in the participant database of FIG. 7, will be that registrant/participant's
maximum allowable bid
during the upcoming open auction. The authorization hold verifies and reserves
the payment
means for the seller, while limiting unauthorized bids made by agents of the
registrant/participant.
Refernng again to FIG. 3, in step 37, the registrant is notified that the
registration was accepted
-14-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
and then in step 38, the records are sent to the participant database before
the registration is ended
in step 39.
At step 22 of FIG. 2 before the auction is opened, an Internet site is
constructed and
initiated to provide viewing of graphical displays of the seating and sale
information to the
participants. FIG. 9 represents one such view, with initial minimum bids
displayed in each
section. All potential participants may access and view this site before the
auction is opened.
When the auction is opened, the central computer 12 of FIG. 1 activates the
site to become
interactive, so participants can use it to place bids on seats in the venue.
The word "seat" as used
herein, and in the appended claims, is intended to refer to any single seat,
group of seats, block
of seats, suite, bleacher seating, standing room only locations, and any other
venue location for
which bidders may purchase tickets or passes. The site activation is
represented as step 40 in
FIG. 4 which is discussed below. When a participant places a bid, the
information is received and
then processed by the central computer 12 of FIG. 1 according to the flowchart
outlined in FIG.
4.
FIG. 4 is a flowchart illustrating an exemplary auction procedure which is
step 25 in FIG.
2. The central computer 12 of FIG. 1 performs all steps in this auction
process depicted in FIG.
4. In addition, all bid information received by participants' remote terminals
is generated by the
central computer 12 of FIG. 1 as web-pages constructed of html programming
code. In step 41
of FIG. 4, a bid information record (bid) is received as a response to a web-
page form: an html
programming tool commonly used to submit information from a personal computer
to a server.
A bid information record includes received identification information,
received section
identification, received quantity information, and received bid price
information. When a bid is
-15-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
received, as in step 41, then in step 42 a check is made to ensure
participant's registration is on
record. This is accomplished by conducting a query on the participant database
15 of FIG. 1,
detailed in FIG. 7, using the received bid identification information as the
query criterion. If the
query finds the participant is not registered, a message to that effect is
sent in step 43 back to the
participant, and the bid is not recorded.
If the query finds the participant is registered, then in step 44 of FIG. 4, a
check is made
to ensure the participant's bid exceeds the standing minimum bid for the
particular section
requested. This is accomplished by conducting a query on the main auction
database 16 of FIG.
1, detailed in FIG. 5, using the received section identification and bid price
information as the
query criteria. If the query finds the bid price too low, a message to that
effect is sent in step 45
back to the participant, and the bid is not recorded. If the query fords the
bid price is not too low,
then in step 46, a check is made to ensure the participant's bid is less than
the established
maximum; specifically, the amount of the authorization only hold established
in the participant
registration and stored, for example, under the field name "SLIMIT" in the
participant database
of FIG. 7. Again, this is accomplished by conducting a query on the
participant database using
the received bid price information as the query criterion. If this maximum is
exceeded, a message
to that effect is sent in step 47 of FIG. 4 back to the participant, and the
bid is not recorded. Upon
receipt of such a message, the participant may chose to re-register in order
to raise the set
maximum. However, an agent of the participant would be unable to do so without
the credit card
information. Thus, protection is afforded by use of the password established
in the participant
registration and stored, for example under the field name "SETPASS" shown in
the participant
database of FIG. 7.
-16-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
Referring again to FIG. 4, if the comparison in step 46 is positive, then the
bid is accepted
and displayed as in step 48. In step 49, the bid information record is
recorded to the main auction
database of FIG. 5 and indexed to the corresponding participant in the
participant database of
FIG. 7. In step 50 of FIG. 4, again using the received bid price information
as the query criterion,
S the bid is then inserted at the appropriate rank in the seating database of
FIG 6, described below,
and indexed to the corresponding bid record in the main auction database of
FIG. 5, with lower
standing bids being reordered to reflect the new standings. At this step, the
lowest bids) are
removed from the order, (bumped), unless additional seats are still available.
Bumped bids are
stored in a market research database, represented in FIG. 8, the format of
which is similar to that
of the main auction database. An added function of this database is to ensure
that an accurate
record of each bid event can be identified for customer service purposes.
Next, participants
whose bids become too low are notified
As shown in step 51 and step 52, if the standing bid price of a pre-selected
key seat in the
graphical representation has changed as a result of the latest bid, this
change is reflected
immediately by automatically updating the display of the current bid
standings. These prices are
displayed within the graphical view of the seating and sale information, just
as the initial
minimum bids were displayed in FIG. 9. A representation of this real-time bid
status view is
shown in FIG. 10. This interactive view gives participants clear, useful
information sufficient
to make bid decisions, regardless of the number of tickets for sale or what
location is desired.
More precise information is readily obtainable by simply clicking the mouse on
the desired
section. This action summons the bid form along with a more precise bid status
graphic such as
shown in FIG. 11. The standing prices represented on these interactive sites
are obtained by the
-17-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
central computer 12 of FIG. 1 from records stored in the seating database 17
and inserted into the
html file for display to participants. This task is step 52 of FIG. 4 and is
repeated each time a
change has occurred in the standing bid price of one of these key seats. This
determination is
represented as step 51 of FIG. 4. These changes are automatically presented to
the participants
by means of META refresh, a client pull type html programming feature which
directs the
browser to automatically refresh the information every x seconds, where x is a
variable
programmed into the html file code. If no key seat prices have changed, no
further action is taken
until the next bid is received or the auction is ended. In step 53, the
auction may be ended in
response to a signal which may be sent from the master computer 11 of FIG. 1
or from an internal
timer or some other predetermined means.
In step 54, of FIG. 4, finalizing the seat assignments involves application of
an algorithm
designed to ensure that seats within a bid are contiguous. FIG. 12 is and
example of such an
algorithm. For each section of seats in the venue this algorithm is executed,
starting with the
highest bid, obtained in step 121, and working back. If the bid presently
under evaluation is the
last in its section., then a different algorithm is used. This determination
and action is step 122
and step 123. If the bid presently under evaluation is not the last in its
section, then in step 124,
it is determined if the number of seats required by the bid is more than the
number existing in its
row. If so, it is impossible for all the seats to be contiguous, and the
process begins for the next
bid, in step 128. If not, in step 125 the next decision is to see if there are
any breaks in the seat
grouping. If not, the process again begins for the next bid, in step 128. If
so, the group of seats
is moved to the next row back, step 126, and the resulting seat vacancies are
filled by moving the
next lower bids) forward, step 127. In unusual circumstances, this could
result in the moved
-18-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
group spanning two rows again. In this exemplary algorithm, the group will not
be moved again,
it will remain split. When the last active bid is processed, the last-seat
algorithm shown in FIG.
13 is applied. If the number of seats in the bid is greater than the number of
seats remaining in
the section, step 131, then in step 132 the bidder is notified of the cut-off
and asked it the reduced
number of seats will suffice. In step 133 and step 134 if the reply is
negative or if there is no
reply within 2 minutes, the bid is removed. If there is a positive reply, the
number of tickets is
reduced to the available amount, and the algorithm is ended.
Refernng again to FIG. 2, step 26, upon auction closing, successful bidders
are
immediately notified at their terminals and payment is confirmed. The credit
cards are debited
for the appropriate amounts, and the excess amount from the 'authorization
only' hold is released.
The tickets are then delivered by any of a number of conventional means.
FIG Sa and FIG. 5b represent the main Auction database which stores and ranks
all active
bid records and pairs the associated participants and seats accordingly, by
referencing the two
refernng databases. FIG. 5a is the design view of this database, defining the
fields and their
parameters, while FIG Sb is the table view showing sample bid records for the
first bids in a
hypothetical auction. FIG. 6 depicts the seating database, which is the other
referring database
containing a record of each seat in the venue arranged in order of preference
as predetermined by
the promoter or ticket seller. This would probably be based on criteria such
as distance from center
stage, center court, or the finish line. In the case of a festival seating
events, accessing the seating
database would not be necessary.
The databases shown in FIG. 5, FIG. 6 and FIG. 7 contain records for a
hypothetical auction
that is greatly simplified for illustration purposes. This hypothetical event
venue contains only 12
-19-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
available seats, each defined by a record in the seating database (FIG. 6b).
As shown, minimum
bids had been pre-set at $15 and the highest bid received was bid #1 of $30,
with a quantity of 2
seats. The first field in the seating database, "SEATID" contains the Unique
seat identification
number which is indexed to the main auction database (FIG Sb) by the fields
"FSEATID" (first seat
identification number) and "LSEATID" (last seat identification number). The
last field is
"BIDDERID", in which are stored indices referencing records in the participant
database. As
shown in FIG Sb, the lowest bid was #3, requesting 2 seats at $15. However,
only one seat was
reserved, since only one was available at that bid level. As detailed in FIG.
13 above, when the
auction is ended, if one ticket is not satisfactory, this participant will be
given the opportunity to
cancel the bid.
FIG. 10 is a sample participant interface to the auction system during the
open auction,
represented here as a web page with graphical links to forms for placing bids.
As exemplified here,
the participant wishing to bid, simply uses a mouse to click on the desired
section, calling up a bid
form and a more precise view of standing bids to use as a guideline. FIG. 11
shows this more
precise view for a participant who clicked on section C. The form on the right
confirms this
selection and prompts the participant for the specific bid information; while
the diagram on the left
shows that if, for instance, the bid placed is $73, then the seats will be in
the middle of section C,
unless future (higher) bids push it back. Likewise, in practice it is
possible, albeit tedious, to
display bid prices in every row or even for every seat.
Accordingly, a ticket seller could promote numerous entertainment events
simultaneously
at one network site, with the added step for the registrant/participant of
choosing the desired event
from those presented.
-20-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
In one embodiment, a template may be loaded into participants' terminals prior
to their
accessing the auction site, said template providing text or graphic
information that does not change
during an auction or between auctions, such as background art, forms or
instructions. Said
template may be downloaded from the Internet, or installed from a disc or by
some other means.
Use of a template allows the bid status updates to be made with transmission
of only the numerical
data, which in combination with the template, presents the comprehensive
auction status update
to participants. In another embodiment, the bid status changes are
automatically presented to the
participants by means of the multipart/mixed MIME format, a recently available
server-push type
programming feature which takes advantage of a connection that is held open
over multiple
responses, allowing the server to send more data at will. This method can be
more efficient, since
new HTTP connections do not have to be reopened.
Various other alternative embodiments of the invention are also possible. For
example, as
shown in FIG. 14, after a participant places a bid, he or she is be presented
with participant
preference options on a participant preference screen 200, which is a terminal
screen that asks the
participant a number of questions concerning the participant's bid. Under a
seating options block
202 on the participant preference screen 200, the participant is given the
participant preference
option of canceling the bid or moving back to another section if the
participant is unable to secure
a bid in the desired section. The system will generally default for the
participant to be moved back
a section unless the participant changes this option to cancel the bid in the
event of a bump. Thus,
if a participant has bid on seats in Section B, but that bid is bumped, the
participant will
automatically be moved back to Section C upon being bumped from Section B,
unless the
participant instructs the system completely cancel the bid in the event the
bid is bumped.
-21 -
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
Another participant preference option presented to the bidder under the
seating options
block 202 is the option for a front row seat. Certain bidders may be
exclusively interested in a
front row seat. Under this option, the participant may instruct the system to
cancel the bid if the
bid is bumped from the front row. Thus, if a participant makes a bid and
specifies that he must be
in the front row, the system will cancel the bid if the bid is bumped from the
front row.
Alternatively, the participant may state that he simply prefers the front row,
but will take other
seats. Thus, under this option, the system will leave the participant with a
front row seat so long
as his bid is consistent with the other front row bids. If the participant is
bumped from the front
row, the participant's bid will not be canceled, but he will simply be moved
back. This will
generally be the system default. Finally, the participant may state that he
absolutely does not want
the front row, and he should be moved back if his bid lands him in the front
row. Thus, under this
option, the system will place the participant in the second or other
subsequent row even if his bid
qualifies him for the first row.
The seating options block also allows the participant to specify aisle seat
preference as a
participant preference option. The system may present the participant with a
number of choices
concerning the aisle, including the following options: (i) must have an aisle
seat and will move
back to get on the aisle, (ii) will not accept an aisle seat, (iii) prefer the
aisle, but will accept other
seats, (iv) do not prefer the aisle, and (v) don't care. The "don't care"
option is generally the system
default. Based upon the participant's input, the system will attempt to place
the participant in the
desired location either on an aisle or away from an aisle.
A number of otherparticipant preference options other than those described
above may also
be specified in the seating options block 202. For example, the system may
also give participants
-22-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
options for being placed near concession stands, restrooms, exits, or the rear
of a section. Other
preference options are also possible and may be easily incorporated by those
of ordinary skill in
the art.
The participant's preference screen 200 also includes an option 204 that
allows the system
to receive lock-in seating information. This option 204 allows the participant
to secure a seat
location, upon payment of a premium, regardless of any subsequent bids for the
seat during the
auction. This premium may be expressed in any number of ways such as a flat
dollar amount (e.g.,
$25) or a percent of the bid value (e.g., SO%). The premium is expressed on
the preferences screen
200 by lock-in premium line 208. Thus, if the participant makes a bid of $80
per seat for five seats,
and this bid currently places the bidder in the second row of section B, the
participant may lock-in
these five seats upon payment of the premium. If the premium is 50% of the bid
value, the
participant would be required to pay $40 per seat, or $200 total dollars to
secure these five seats
until the close of the auction. If the participant does choose to lock-in his
bid by paying the
premium, the participant will retain all five seats throughout the auction
even if a subsequent bidder
offers $120 or more for the same seats.
The participant's preference screen 200 may also include an option that allows
the system
to receive proxy bid information. The proxy bid options are shown under proxy
block 206.
According to the proxy bid options, the participant may enter a maximum proxy
bid amount in
addition to the current bid amount. The maximum proxy bid amount is the amount
that the bidder
authorizes the system to bid in his absence in order to keep the bidder in the
preferred seat or
location. Under this block 206, the bidder has the following three options:
(i) keep the bidder in
bidder in the same seats for up to the maximum bid amount, (ii) keep the
bidder in the same section
-23-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
for up to the maximum bid amount, and (iii) keep the bidder in the bidding,
anywhere in the venue,
for up to the maximum bid amount. Thus, if the participant bids $80 for a seat
in Section B, but
authorizes proxy bidding up to $120, the participant may leave the auction,
knowing that proxy
bids will be made for him up to $120 should a subsequent bid exceed his bid.
If the participant
chooses the option to stay in the same seat for up to the maximum bid, the
system will keep the
participant in that seat until subsequent bids for that seat are received
exceeding $120. After that
time, the participant's bid will be bumped. If the participant chooses the
option to stay in the same
section for up to the maximum bid, the participant will be bumped to the rear
of the section as
subsequent bids are received for greater than $80. Once bids for the rear of
the section reach $80,
the participant's bid will automatically increase to keep him in the section
up to a value of $120.
Once all bids in the section exceed $120, the participant's bid will be
bumped. Finally, if the bidder
chooses to simply stay in the bidding for up to $120, the participant's $80
bid will be continually
bumped to less preferential seats in the venue, as bid values exceed $80. Once
the least preferential
seat in the venue reaches $80, the participant's bid will automatically
increase to keep him in the
venue for up to a bid of $120. If bids for the least preferential seat in the
venue exceed $120, the
participant will be completely removed from the bidding.
In another alternative embodiment of the invention, a bidding activity meter
302 is used as
shown in FIG. 15. The bidding activity meter shows a graphical representation
of the rate of
bidding on tickets in the venue (e.g., bids per hour). The meter shows a
number of different
bidding rates from left to right across the meter. A bar extends from the left
side of the meter
toward the right side of the meter to represent the current bidding rate. In
this manner the
participant can see the current rate of bids place for tickets in the venue.
The bidding activity meter
-24-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
allows the system to have an adjustable bidding window based upon bidding
activity. The
adjustable bidding window may be defined as an adjustable period of time that
may be immediately
terminated upon the bidding rate reaching a predefined low threshold. For
example, the system
may set up an auction for tickets to a particular event starting at 10 a.m. on
a particular day. The
S auction may be set up to accept bids for at least five hours, until 3 p.m.,
but for no more than
fourteen hours, until 12 p.m. Bidding will remain open after 3 p.m., so long
as the bidding
continues above the predetermined threshold (e.g., 1000 bids per hour).
However, if the bidding
drops below that threshold, the auction will be closed immediately. Thus, the
auction will
definitely accept bids from 10 a.m. until 3 p.m. If the total bidding from
3p.m. to 4 p.m. exceeds
the threshold rate, the bidding will remain open. However, if at any time
before 12 p.m., the
bidding rate drops below the threshold, the bidding will immediately cease.
Thus, if the threshold
is 1000 bids per hour and the total bidding during the hours of 9 p.m. and 10
p.m. drops to 900
bids, the auction will close, and no further bids will be taken.
Because the auction may be conducted over an adjustable time period using the
bidding
activity meter, the bidding activity meter encourages bidders to place their
bids early and not wait
until the very last minute before auction closing to place their bids. When a
large number of
bidders wait to bid at the very last minute before auction closing, the system
may be unable to
handle the large number of bids and all bidders may not be allowed to place
their bids. If all bids
are not placed, the market price per ticket is not realized. However, the
bidding activity meter
prevents this problem by encouraging bidders to place their bids early. With
the bidding activity
meter 302, bidders will monitor the bidding activity meter and place their
bids immediately when
the realize that bidding is reaching the low threshold level.
- 25 -
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
In a further embodiment of the invention, bidding may be split into a first
session and a
second session. In this first session, bids are taken to determine which
bidders will receive tickets
to the event. In this session, a market price is determined for the least
preferential seat in the
venue. Alternatively, bidders may bid on the least preferential seat in each
section. Bidders
S making bids in excess of the market price are locked into a seat and allowed
to bid in the second
session. In the second session of bidding, bidders place bids on particular
seats in the venue. The
most preferential seats in the venue are awarded to the highest bidders,
consistent with the method
of conducting an auction described herein. The bid activity meter 302 may be
used in both the first
and second session of bidding to define the time limits that bidders have to
place bids during the
first or second sessions.
It is to be understood that the above-described embodiments of the invention
are merely
illustrative. Other implementations may readily be devised by those of
ordinary skill in the art
which will embody the principles of the invention and fall within the spirit
and scope thereof. In
particular, the exemplary contiguous seat algorithm of FIG. 12 may readily be
modified to allow
repeated movements of a group to ensure adjacent seating or to allow block-
style groupings, or
other variations. Moreover, this ensuring of contiguous seats shown at step 54
of FIG. 4, could be
performed as each bid is placed, rather than only at the close of the auction.
Likewise, the last seat
cut-off in step SS of FIG. 4 could be executed with each bid made.
Additionally, the auction
system may readily be modified to sell each section of the venue in succession
or at different
Internet locations. Other embodiments may provide additional incentives for
bidders to bid early
in the auction. For example, those bidding within the first ten minutes from
the auction opening
may be awarded cash value certificates for redemption at the event for
concessions or gift shop
-26-
CA 02399155 2002-07-31
WO 01/59649 PCT/US00/03136
items. Larger awards may be granted for earlier bids (e.g., $10 for a bid
within the first ten minutes
after auction opening) and smaller awards may be granted for later bids (e.g.,
$2 for a bid within
the first hour after auction opening). In other alternative embodiments,
certain classes of people
may be awarded preferential treatment during bidding. For example, alumni bids
may be
augmented by a given dollar amount, alumni may given access to a certain
portion of the arena, or
alumni may be allowed to place bids after the auction closes.
-27-
