JP2001524719A - System and method for conducting an auction on a computer network - Google Patents

Abstract

(57) [Summary] The present invention is a computerized auction system having an auction means for processing a bid transmitted from an auction participant, and accepting bids and participating in details of auction status. The successful bidder is determined from the participants based on the received bid, and the successful bidder is transmitted to the participants.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

TECHNICAL FIELD OF THE INVENTION

The present invention relates to an auction system, and more particularly, to a system and method for conducting an auction on a network such as a computer network or a TV network, or by an automaton.

[0002]

2. Description of the Related Art

The disclosures of the following documents are incorporated herein by reference. U.S. Pat. No. 5,282,633 (February 1, 1994, issued to Boylan et al.); U.S. Pat. No. 5,083,271 (January 21, 1992, issued to Thatcher et al.); U.S. Pat. U.S. Pat. No. 4,927,156 (May 22, 1990, granted to Breslow et al.); U.S. Pat. No. 5,009,429 (Granted to Oxia on April 23, 1991, U.S. Pat. No. 4,637,614). Granted to Gibbon et al., Oct. 18, 1985); U.S. Pat.
No. 261575 (Granted to Coleley et al., April 14, 1981); U.S. Pat.
US Pat. No. 4,922,559, issued September 24, 1996 to Lucero;
No. 522 (May 1, 1990, granted Skanron); U.S. Pat. No. 4,998,199.
No. 5,380,022 (issued to Tashiro et al. On Mar. 5, 1991).
Granted to Lucero on August 6, 1991); U.S. Pat. No. 5,159,549 (Jan.
U.S. Pat. No. 5,083,272 (January 21, 1992, granted to Walker et al.) And U.S. Pat.
PCT application: WO 95/31061 (filed May 5, 1995 by Catapult Entertainment); WO 93/23125 (filed May 14, 1993)
, Filed by Code Masters Limited) and WO 93/22017 (1
And European Patent Application 0 405 776 A2 (published January 2, 1991).

[0003]

[Means for Solving the Problems]

The present invention, in a first aspect thereof, relates to a computerized auction system and includes the following features: processing bids transmitted from auction participants and receiving bids; Auction means for transmitting the details of the auction situation to the participants, determining the winning bidder among the participants based on the received bid, and transmitting the winning bidder to the participants; and separate bids from each participant. Bidding means for communicating separately to the auction means and processing details of the auction situation and receipt of bids transmitted from the auction means; and network means for providing a communication transmission path between the auction means and the bidding means; And the information transmitted over the network means between the auction means and the bidder means comprises a first transfer protocol. And at least one of the second transfer protocols, wherein the first transfer protocol comprises a second transfer protocol for ensuring that data representative of the information arrives at one of the auction means and the bidder means. More reliable than the transfer protocol, the second transfer protocol is faster than the first transfer protocol in terms of the time it takes for data to be sent through the network means and received by one of the auction means and the bidder means. Here, the risk associated with the information transmitted under the second transfer protocol is that data is lost during transmission through the network means, and that data is transmitted from each of the bidder means and the auction means. Auction and bidder means in a different order than the That the data arrives to Tsu, and comprises that the incoming data is duplicated into one auction means and the bidder means,
A computerized auction system where these risks are one aspect of the auction related to determining the winning bidder among the participants.

[0004] Preferably, under the second transfer protocol, the bid is transmitted from the bidder means to the auction means, the auction means processes the bid transmitted from the bidder means, receiving the bid and the status of the auction. And auctioner means for transmitting information to the bidder means under the second transfer protocol. Preferably, the auction system further comprises management means for processing the participant's account and processing information relating to the auction, separate from the information transmitted between the auctioneer means and the bidder means, preferably the auction system. The means include auction support means for facilitating the auction means to initiate an auction, the auction support means being a management means on a secured communication channel, outside the network means or through a transmission path via the network means. And communicate information.

[0005] In one preferred embodiment of the auction system of the present invention, the network means includes at least one of a telephone network, a public postal network, a telefax network, a corporate information network (LAN), and the Internet. The second transfer protocol includes Transmission Control Protocol / Internet Protocol (TCP / IP), and the second transfer protocol includes User Datagram Protocol (UDP).

In one preferred embodiment of the auction system of the present invention, the bidder means communicates information with the auctioneer means under an auction protocol in a higher layer (layer) of the first or second transfer protocol. , These auction protocols may include auction management and bidding protocols. Further, the bidding protocol preferably comprises: a price of said bid, a number of messages of each said participant received by said auctioneer means from said bidding means, an idea of a time of said auction by each said bidding means, Identification of the winning bidder, the start time of the auction, the time at which the auction ends and the latest one of the bids becomes the final bid, the number of the bids transmitted to the auctioneer means at one time, It includes parameters including the number of bids made by participants, the time one of the bids must survive to win the auction, and the number of participants.

The present invention, in a second aspect thereof, relates to a computer network auction system server, comprising: means for processing a bid transmitted from an auction participant through a computer network; Means for communicating information to the participant in response to the bid made, means for determining the winning bidder among the participants based on the bid received through the computer network, and communicating the successful bidder to the participant through the computer network. Means, a means for a first transfer protocol under which the means for transmitting information and the winning bidder are implemented, and a second means for transmitting a bid from the participant through a computer network under the protocol. Means for secondary transfer protocols With regard to the transmission of information to its destination, the transmission of information is more reliable under the first transfer protocol than the second transfer protocol, and the transfer of information is In terms of the time it takes to arrive at the destination, the transfer of information is faster under the second transfer protocol than the first transfer protocol, where the transfer of information under the second transfer protocol is The associated risks are that bids are lost during transmission over the computer network, that the bids of each participant arrive in a different order than the time order in which the bids were sent from each of the participants, and At least one of the bids arriving at the intended destination is duplicated, and these risks are part of the auction for the means to determine the winner among the participants, And wherein the computer is a network auction server.

[0008] Preferably, the computer network auction server as described above includes management means for processing a participant's account, the management means further processing content in the form of a world wide web page for communicating with the bidder means. Including means to do. Preferably, the first transport protocol comprises a Transmission Control Protocol / Internet Protocol (TCP / IP) and the second transport protocol comprises a User Datagram Protocol (UDP).

[0009] A third aspect of the invention involves a method of implementing an auction system over a communication network, the method comprising the steps of: a. Communicating to the device; processing the received bid by the auction computer device; providing the receipt of the bid to the input computer device by the auction computer device over a network; and inputting the computer device by the auction computer device. Determining the winning bidder among the participants based on the bids received from the auction, transmitting the winning bidder among the participants to the input computer by the auction computer device, and Providing first and second transfer protocols under which the transmission of information between the auction computer device and the input computer device is performed, wherein the transmission of information reaches certain intended destinations In that regard, the first transfer protocol is more reliable than the second transfer protocol and is transmitted over a computer network, and the second transfer protocol requires at least one of an input computer device and an auction computer device to transmit information in a second time. Transfer protocols are faster than the first transfer protocol, where the risks associated with transmitting information under the second protocol are loss of information transmission in the network, input and The order in which the transmission of information was sent from one of them different from the temporal order , The transmission of information arriving at one of the input and auction computers, and the duplicate transmission of information arriving at one of the auctions and the input computer. This is a method that is one aspect of the auction related to the determination of.

[0010] Preferably, a method according to a third aspect of the invention comprises processing the participant's account and storing the results of the auction. The network is
It may include a public postal network, telephone network, telefax network, radio network, TV network or computer network.

[0011] The network used may include the Internet, the first transfer protocol includes a Transmission Control Protocol / Internet Protocol (TCP / IP), and the second transfer protocol includes a User Datagram Protocol (UDP). )
Can be included.

[0012] Preferably, the method according to the third aspect of the present invention comprises the step of, between the auction computer device and the input computer device, under an auction protocol that is on a higher layer (layer) of the first or second transfer protocol. Performing communication of information regarding the bidding of the bid. Auction protocols may include auction management and bidding protocols. Preferably, the bidding protocol includes the price of each bid, the number of messages for each participant received by the auctioneer from the bidder means,
The idea of the auction time by each bidder means, identification of the winning bidder among the participants, the start time of the auction, the time when the auction ends and the latest one of the bids becomes the final bid, at a time to the auctioneer means It includes parameters including the number of bids to be transmitted, the number of bids placed by each participant, the time one of the bids must survive to win the auction, and the number of participants.

The present invention, in a fourth aspect thereof, relates to a method for conducting an auction on a computer network server, the method processing bids transmitted from auction participants over a computer network. Communicating information to the participant through the computer network in response to the bid transmitted from the participant; and determining the winning bidder among the participants based on the bid received through the computer network. Communicating the winning bidder among the participants over a computer network, and communicating over the computer network under one of the first and second transfer protocols, Under the transfer protocol of the second than the second transfer protocol Reliable, but time-consuming, delivery of information to its intended destination, and the risk of loss, delay, and duplication of information under the second transfer protocol determines the winning bidder among participants This is a method characterized by being one aspect of the auction.

The present invention, in a fifth aspect thereof, provides an auction system based on the presentation of stake-supported bids from auction participants within a preset time limit. The system may include a communication network for the transmission of information between the auctioneers and the participants, the auction system comprising:-interface means adapted to submit bids from the participants; Detector means for detecting the offered bid;-A real or simulated clock which is present with the auctioneer to indicate the start and end of the auction and record the time of execution of the auction as well as the time of the bid detection in the detector means. And determining means for determining the result of the auction, wherein the result of the auction is represented as a function of the time of bidding.

[0015] Preferably, the determining means determines whether a predetermined time or a time that changes according to a predetermined rule has elapsed after the last bid without detecting a new incoming bid. If no new bids are detected after the last bid, the participant who placed the last bid found is identified as the winner of the auction and Otherwise, the participant who submitted the last bid before the end time of the auction is identified as the winning bidder.

The interface means may be a computer terminal attached to a real-time data transmission communication network via a modem, wherein the auctioneer is then attached to the same network by a similar computer terminal. Further, the auctioneer clock, detector means, and decision means can be included in an auctioneer computer adapted to process an auction according to a programmed auction algorithm. Preferably, the auctioneer computer algorithm is to process bids submitted in real time by participants during the auction. In a specific embodiment, the computer may be capable of making corrections in the event of a transmission delay from the participant's computer terminal.

One algorithm of the auctioneer computer is an algorithm that varies the length of time to “hammer down” as a function of the elapsed time of the auction, or of the occasional bid submission rate from all participants. Good.

In order to present to each participant the progress and activity of the ongoing auction, the participant's computer terminal and the communication network may be able to transmit information from the auctioneer computer in real time. In a particular embodiment, the auctioneer computer algorithm may process bids submitted by each participant as a group within a fixed time, after which time the computer will immediately proceed with the auction. Simulate the whole.

The total number of bids during an auction can be predetermined, and the auctioneer computer algorithm then determines from each participant at the same time that the participant enters or pays for the auction. Bid submitted can be handled. Alternatively, if no limit is placed on the total number of bids in the auction, the algorithm at the Auctioneer Computer will: a) pay bids from each participant / enter the auction within a predetermined time; Calculating the length of time from start to end, c) setting a time limit from each participant for the presentation of grouped bidding times, and d) from the participants. A simulation of the entire course of the auction following receipt of the bid and expiration of the time limit.

The auctioneer computer, the participant's computer terminal, and the communication network may further include information about the progress of the simulated auction on a screen in real time or on a converted time scale. To be transmitted. In a more specific embodiment, the auctioneer computer may also transmit auxiliary information to the participant's computer terminal according to special programming, wherein the auxiliary information is ( a) Real-time or simulated auctions to display images / audio or an auction-related, entertaining or distracting short video next to or in the background of the auction information to enhance the auction's appeal Is controlled by an auctioneer clock and, if possible, in accordance with the ongoing auction development, or (b) entry / payment /
During the preliminary bidding phase, it may be information about entertainment or auctions or ancillary information including animations containing advertisements.

[0021] In another embodiment of the auction system in a fifth aspect, the auctioneer computer causes the participant to display data on the progress of the auction on his computer terminal automatically or on demand after the auction closes. As such, a memory may be included that stores the entire history of the auction.

In one embodiment according to a fifth aspect of the invention, wherein the embodiment relates to an auction conducted by an automaton, at least one participant is a genuine participant and the plurality of participants are simulated A participant, the system further comprises:
Including an auctioneer random number generator that controls the number of simulated participants and their bidding time according to a predetermined random number generation algorithm, this algorithm reduces the probability of winning an auction to the extent consistent with national law. Includes adjustable parameters to adjust.

In a preferred embodiment of the fifth aspect of the auction system, the communication network can be divided into two parts: a part of the communication network is a public telephone network, a computer terminal,
Any of a computer terminal and a reverse TV channel network;
The auctioneer may broadcast any of radio programs, television programs, and teletext television programs through the other part of the communication network; The other part may be constituted by any of public radio channels, television channels, and closed circuit networks, where real-time information on the progress of the auction of radio / television / teletext television programs is sent.

In a completely different embodiment of the auction system according to the fifth aspect of the invention, the interface means is a coupon filled out by each participant and sent to the auctioneer, wherein the coupon is for a predetermined time. In the frame,
If there is a large number of bids defined according to rules and stakes, including information about the bid time desired for the participant, the detecting means is a coupon reading unit, and the determining means is associated with the coupon reading unit. A programmed computer, wherein the clock is a simulated clock, according to which bids from participants are ordered in time, and the communication network is a public postal network, telephone network, telefax network, or computer network. It is.

According to a sixth aspect of the present invention, there is provided an auction method based on a bid submitted with stakes by an auction participant within a predetermined time limit. The auction is the next step, at least through the interface means, to indicate to the auctioneer the bids from the participants, to detect the bids submitted by any participant by the auctioneer bid detection means, and with the auctioneer, Using an actual or simulated clock that indicates the end time and records the auction execution time as well as the time of auction detection by the auctioneer bid detector; and determining the auction result by the auctioneer determiner. Including the auction here The results are expressed as a function of the bid time. Preferably, the auction method also determines whether a predetermined time, or a time that varies according to predetermined rules, has elapsed since the last bid without detection of a new incoming bid. Investigate, if no new incoming bids have been detected since the last bid, identify the participant who placed the last bid found as the winner of the auction, throughout the auction's elapsed time Otherwise, qualifying the participant who submitted the last bid before the end time of the auction as the winning bidder.

[0026]

BEST MODE FOR CARRYING OUT THE INVENTION

A more detailed description of the invention will now be described with reference to the exemplary embodiments shown in the accompanying drawings. FIG. 1 is a schematic diagram of the general features of a computerized and network-based auction implementation of the present invention. In this embodiment, the auctioneer uses at least two network servers as shown on the left side of the figure. Of these two servers, one server is a management server for mainly processing the participant's account and related information, and the other server processes a bid sent from the participant via the network. And a server for performing processing for transmitting detailed status information of the auction being executed to the participants. This figure further shows an example of the outline of the participant's PC and communication network. FIG. 2 shows an example of a hardware and software platform required for the required two network servers. Since the figure is mainly composed of text and does not require any particular explanation, the text of this figure is cited here as a part of the present specification. FIG. 3 shows an example of a hardware and software platform required for a participant's PC. Since the figure is mainly composed of text and does not require any particular explanation, the text of this figure is cited here as a part of the present specification.

Although the invention was originally made as a network-dependent invention, the original auction concept can be easily applied to a wider range of market segments. Examples of applications are:-"Game Boy" type equipment-Distribution / simulation by CD-Automatic game equipment-Advertising tools / Third party company product auctions I am convinced that it can be improved with a low budget.

Underlying the concept of the “American auction” is making a successful bid at an auction
ToStrategic skillsThere is a concept that is important. Participants will be able to
Improve strategic (and analytical) skills by participating in
Improve general strategic skills in live / business situations,Educational And a competitive element. Last but equally important
, Participants will experience the excitement of the auction and the various themes that support it Entertainment Is obtained. Strategy, education and entertainment are the three most important and attractive aspects of the auction concept
/ Features to sell, which are found in all versions of the invention.
(Should). In developing the concept of this auction,
Due to the focus on gender, these characteristics exist as an integral part of the concept.
I am convinced. However, different market segments / populations have a greater focus on these factors.
Segmentation according to the size of the stake / pot
In addition to doing, it is important to “touch” the product / theme and the actual media
You. This allows the auction organizer to cover a wide range of markets and cover both high and low "status" markets. In addition, conventional gaming devices, “Game Boys”, pure entertainment games (using PC and / or Internet).
Competition with the game to be used).

In addition, this auction is carried out by a computer / internet-related company (as well as an unrelated company) by selling a license or setting up an auction with its product as an auction prize. It has been revealed to the inventor that it can be a good marketing tool for advertising and selling products. Such auctions can be distributed by lookup on CDs (via personal computer magazines, etc.) or through a web browser or corporate homepage. This idea is likely to have great potential to become a new marketing / promotion concept that can make a product stand out to interested customers over time.

The concept is based on a number of “side products” that emphasize strategic, educational, and / or recreational features.
in-off) "products and their variants. 1. In the case of “Game Boy” palm-held devices, the competition is limited to a limited number of participants (competitors), a limited number of bids to be bid / owned, and per participant / participant groups. It is done with various numbers of bids. This flexibility allows you to set different levels of difficulty, similar to current “Game Boy” devices, and also includes themes, strategies,
They can have completely different characteristics with respect to entertainment value. Game pots take the form of points. However, due to limited capacity, the theme of entertainment is relatively simple technically.

2. Simulation auctions (having similar features to the "Game Boy" version) distributed via CD or the Internet have more sophisticated animations and selectivity and are distributed (for CDs) via PC magazines / emails etc. And executed on a personal PC. This product is excellent for improving the animation properties of the original auction concept, realizing a stand-alone as an entertainment product, and training actual coin auctions. These simulation auctions distributed via CD / Internet are also excellent media for advertising (see above).

[0032] 3. Automatic Game Machine / Competition Simulation Same concept as 1 and 2 above, but with a prize to the winner. In many countries, such automated device auction concepts are within the scope of game-related laws and regulations. The prize depends on the difficulty selected. The product will compete directly with the existing game console market and will need to consider licensing existing operators.

[0033] 4. An auction that has been set up for the purpose of advertising a product, and the prize / auction object is a product of a company that is promoting the auction. Internet and C
D distributed by both.

First Preferred Embodiment of the Invention: System for Performing an "American Auction" on the Internet An American auction is similar to a regular auction, in which a player places a bid and a certain period of time for a certain bid. , The last bidder wins if there are no other competitive bids. However, in this auction, the "size" of all bids is the same, the player pays for each bid, and the player with the last valid bid wins. 1 to 8 show the outline.

Auctioneers preferably use programs to process bids from approved bidders. This program is executed on a device connected to the Internet. Bidders must use the same Internet-connected equipment as the Internet to which Auctioneer is connected. The device must have a WWW browser that can download and execute Java applets. All participants in the auction communicate with the same (one) auctioneer using a special "auction protocol" that belongs to a layer above the standard Internet protocol.

FIG. 4 is an overall view of one embodiment of the computerized auction system of the present invention. The first level parameters include auction rules, auction protocols, system capacity, performance / optimization, auction operations,
And security matters. At the next level, the auction protocol is divided into an auction management protocol and a bidding protocol, each of which is processed separately. One level below the performance / optimization level includes avoiding data conversion,
Another aspect is a reduction in message traffic volume.

Under security matters are initialization, bidding, overload and result distribution related aspects. 1. Rules (See Fig. 5) 1.1 Preparation ・ The number of players is N ・ Each player must purchase at least the minimum number of bids before the auction starts ・ Currently, there is no upper limit on the number of bids that can be purchased by one player ・Once the auction starts, the player cannot purchase additional bids. 1.2 Start ・ The player needs to determine whether he wants to participate before the auction starts. (If you do not participate, you can watch the auction and participate later to reduce the risk and increase the chance of winning). ・ It is necessary to be able to re-enter after the auction starts (otherwise the client's (The machine crashes.)-The player can log in at any time during the demonstration. 1.3 Play ・ Every time a bid is made, the player is informed of it. ・ The clock starts each time the player makes a bid. ・ If the timeout seconds elapse without any further bids, the final bid is made. Player is declared successful bidder-The duration of the auction is capped at approximately 1-2 hours (compulsory)-The timeout period decreases as the auction elapses

If there is no bidder at the start of the auction, there is an unsolvable problem (chicken and egg problem) that the successful bidder cannot be determined. The initial timeout can be the duration of the entire auction, and this timeout can be set back to "normal" when the first actual bid is placed. This approach is effective for demonstration purposes but probably not suitable for a real auction. Another solution is to set the initial timeout period as usual and make the auction organizer the winning bidder if no one bids during the initial timeout seconds. As a third solution, there is a method of providing a "house player" that makes a bid once at an arbitrary time at the start of an auction and does nothing thereafter. The house player becomes the winning bidder instead of the auction organizer.

In some cases, the auction must be stopped. Suppose there are 3600 players and each player can bid 10 times. Assuming a timeout of 10 seconds, the worst case would be that the auction would last 100 hours,
Obviously unacceptable.

In one embodiment, the timeout time decreases linearly as the auction continues. However, it is not permissible for the time-out time to approach zero and therefore (the round-trip time required for bidding to be greater than the time-out time. Set a lower limit on the time-out time, or as one possible solution, If the auction reaches the time limit without determining the winning bidder, the X-th bid after the time limit wins.

1.4 Payoffs • Unused bids exceeding the minimum number are returned to the player. • Collect a penalty to be paid for at least the minimum number of bids imposed on each player. • The auction organizer earns a cut (eg, 20%) from the total revenue, and the remainder (prize money) is the participant ( The highest bidder). -Those who do not bid do not earn anything-The winning bidder gets a prize (for example, 80%) of the prize money-The winning bidder is reimbursed for what they bid (if possible) -If more money remains: The player who bid the least is redeemed for the player's bid (not including the penalty bid).・ All the excess (rounding error etc.) will be acquired by the auction organizer

[0042] 2. As the auction protocol, for example, an ASCII character code can be used. Each message consists of several numeric fields separated by white space. The first field is a single "tag" character that identifies the message type.

2.1 Auction Management It is convenient to use a highly reliable connection for management commands, ie, login and end commands. As shown in FIG. 6, the participant is required to enter a management command (login or end command)
In order to send a request, the participant (client) needs to take the following steps. 1. TCP connection to auctioneer server / game engine (
1. Open (using the same port number as the UDP connection used for bidding) 2. Initialize the command and put it on the connection (write). 3. Read the response (or “end of file” possible) Close connection

The lower part of FIG. 6 shows two sequential access storage media, both connected to the management network server, one containing data about the authenticated participant (player) and the other storing logs. I do. The management system will distribute the client code to the participants along with the "name", (ultimately) authentication information, encryption key, and the like. Participants need to log on to the server via a login message at the start of the auction. The server (Auctioneer) returns a reception message or an error message.

Login = L name port Accept = A winner start now deadline bidsname bidsleft timeout who serial Error = E string name alphanumeric character port UDP port that client wants to use winner ID of current successful bidder now Present of Auctioneer's idea Time start When the auction was started (if a start> now, the auction has not yet started) deadline The time that the auctioneer considers when the current bid will be the last bid (if deadline <now, the auction ends Serial) The serial number of the response message. Bidsmade How many bids have been made so far (total). Bidsleft Number of remaining bids of the player who Numeric ID used by the player to continue communication with the server timeout Duration required

If the participant knows the end of the auction, it should request the result by sending a Quit message. The server responds with a payoff message, a waiting message (if the auction has not yet ended), or an error message.

[0047] Quit = Q who Payoff = P who result bidsmade bidspaid Error = E string Wait = W who Numeric ID result net acquisition (loss if negative) bidsmade number of bids confirmed by server bidspaid player must pay A certain number of bids

2.2 Bidding Protocol A reliable real-time communication channel is preferably established between Auctioneer and the participants throughout the auction, but this cannot be provided by the Internet Protocol. Alternatively, UDP is preferably used as the transport protocol for bidding. This means that messages may be lost, garbled, or duplicated. Message delay and message loss should be considered as part of the auction, and participants must recognize these as one aspect of the auction. Auctioneer measures time in seconds when an auction starts. The time that the auctioneers think is valid. Participants can announce that they are still participating and bid.

Bid = B bid serial who now bid Takes a value of 0 (“I'm here”) or 1 (“I want to bid”) serial Each participant records the number of times he or she has sent a message. . The serial number of the first message is 0. who Each participant gets a unique (numerical) ID at the start of the auction now Auction time that the participant views (not previously used by auctioneers)

The client program needs to send empty bids at “slightly random” regular intervals, for example, sending messages on average twice a minute. The auctioneer sends back a receipt each time it receives a message from the player. Auctioneer broadcasts a status message each time it accepts a new bid (and in other cases).

Receipt = R winner start now deadline bidsmade bidsleft serial who when Status = S winner start now deadline bidsmade timeout max winner current winner's ID now the current time of the auctioneer's idea start auction start time (if start> now , Auction has not yet started) deadline Auction time when current bid is final bid (auction is closed if deadline <now) serial Response message serial number bidsmade How many bids so far (Total) bidsleft Participant's remaining number of bids who Participant's numeric ID when "now" value of responding bid timeout timeout Duration required to win bid max (potentially) number of participating bidders (This is the number of “active” participants, and should include only those participants with bids remaining.)

The auctioneer records, for each participant, the serial number referenced last time. Upon receiving the bid (or the "I am here" message), Auctioneer compares the new serial number with the stored serial number. If the new serial number is higher than the stored serial number, the new serial number will be accepted and analyzed and a response will be returned. If the new serial number is less than or equal to the stored serial number, the messages arrived out of order (or duplicated)
. This message is ignored (no response is returned).

It is desirable for the client to calculate the expected round-trip time of the message and synchronize the time considered by the client with the time considered by the auctioneer. The absolute number of bids placed by participants is the number counted by Auctioneer. Clients should be aware of the last message acknowledged and synchronize the client's bids with the auctioneer's recorded bids. The client program should not prevent the participant from attempting to place more bids than would otherwise be possible to send.

[0054] 3. Capacity If bids from certified participants are accepted, each bidder should be notified of the new bid “immediately”. This notification is a message in ASCII character code, is short (less than 100 characters), and its contents are made public. The time it takes for Auctioneer to receive a new bid and broadcast a status message is negligibly short compared to the time it takes to perform the broadcast. The device that executes the auctioneer program needs to have the capacity to send the same (small) message to N different UDP addresses in S seconds. In this case, N is the number of bid participants and S is an acceptable approximation of "immediately."

Since the status message is sent to each bidder at once, the delay time (from the auctioneer) is 0 seconds for the first bidder and S for the last bidder.
Seconds. Bidders may also experience network delays. It is difficult for a bidder to predict the length of an acceptable delay. 1 total delay for bidders
Less than a second is acceptable, but delays greater than 4 seconds would not be acceptable. The test uses 20 Sun Sparcstations,
Performed by running Solaris (Solaris) 2.5. This device can send 1000 to 2000 UDP messages per second to a given location.

[0056] 4. Performance and optimization 4.1 Avoiding data conversion Messages and logs are sent in sentence format, and all numbers are sent in decimal. This can be debugged, but the server will take considerable time to convert between binary data and sentence format. Binary format or special purpose text routines can speed things up.

4.2 Reduction of Message Traffic The client should not send the message “I am here” too often. The client will probably always receive a number of status messages that are properly updated. Sending status messages to all clients is a major obstacle. Such obstacles can be overcome by IP multicast, but IP multicast is unfortunately often not generally available. In order to eliminate the “unnecessary” status message, for example, it is detected whether or not one bid has arrived almost at the same time, and the status message is transmitted only when the last processing is performed. When the load is so high that a batch of bids comes in, the player can stop all but the last bid (which can be the player's acquisition). When the load is high, the receiving message (Receipts) is not transmitted to the non-successful bidder or the empty bid. When the server is not busy, the player can cause the server to send a received "unused" message.

[0058] 5. Auction Flow As shown in FIGS. 1, 2 and 7, the actual auction is performed using (at least) two web servers. FIG. 7 shows a connection example between the central router closest to the network and the auction server. The management server bidirectionally connects to the network during operation based on the reliable first transport protocol, but is not always fast. The management server can display a WWW menu containing demos, participant logon possibilities, other types of information and credit check features. The management server provides usernames and passwords, etc. to auction servers, which are connections that operate based on faster but less reliable transport protocols in other types of networks. Such a fast connection must manage the real time bidding process and ensure that the message (bid) is transmitted to the auctioneer as soon as the participant receives it.

As shown in the figure, the third auctioneer server manages a message common to all participants and operates based on the first protocol. The main management server handles accounting, auction information and web pages and should not be run on the same machine as auctioneers. The "small" web server must run on the same machine as Auctioneer. This server communicates with the main server via a secure channel and has the following tasks (see also FIG. 2):-Sends Java code to legal auction participant (bidder) on request . Start the auction program at the right time with the right parameters (Auctioneer). -Save auction results (logs and payoff matrices).

The auctioneer server is preferably a regular Unix program, which can be started from the command line. The #action options options are as follows: -l string Set log prefix to string. As a specific case, if no log prefix is set, all logs are output to standard output. -B file The file name of the legal bidder, without demo mode. Currently this file is an ASCII text file with one line for each legal bidder. Each row consists of at least two fields, separated by white space. The first field is the name of the bidder. The second field is the maximum number of bids that this bidder can bid on. The following fields are currently ignored, but will include protection information (keys, passwords).

-P port Number of ports used. The same number of ports is used for UDP and TCP. The current default is a nearly random selection at 6010. -S time Auction start time. Currently two formats are accepted, +
n starts at n seconds and h. m is h. Start at m. Current default is +
1 (start one second later). −d minutes The duration of the auction. The current default is 20 minutes. -T seconds Initial suspend time (default is 20 seconds). -M max The default maximum number of bids per bidder during the demonstration (default is 8). -D In demo mode, anyone can log on (including those who do not fall under option -b).

Before the Auction Auction starts, a list of authorized bidders is printed (for accounting and billing). The first line shows an auction, the second line shows a comment, and the remaining lines show each bidder. Each row contains a numerical id, the name of the bidder, and the number of bids the bidder can bid on.

Example: #. /Auction(0.9)1997/11/17/10.19.36=000879760176castor # id who bids 000000.0 000001 Eigil 8 000002 Tom 8 000003 Eirik 8 000004 Brynjulv 8

During the auction, the auctioneer prints interesting events to a log file. Each line starts with a "time stamp", which is the current auction time (seconds elapsed from the reference time), followed by a "serial number" within each second. The log line is a comment line, a login line, an end line, a bid line, or a status line. The status line is printed each time a new status message is issued.

Comment = time-stamp # comments Login = time-stamp L id port name addr result Bid = time-stamp B bid id serial time disp Status = time-stamp S winner left timeout total Quit = time-stamp Q id id Numeric id winner id of the current winning bidder port the bidder intends to use for the status message name bidder's name addr bidder's internet address result One of "ok", "no" or "late" Serial serial number of the bid bid 1 (actual bid) or 0 (no bid) time Time for notification to bidders (auctioneer is not available) disp Bid processing method (emptyBid / GameOver / waitABi)
t / noneLeft / Accepted) left Remaining time until deadline (from timestamp) timeout Current timeout value total Total number of bids bid by all bidders so far

Example of exception: 0879760175.00000 #. / Auction (0.9) 1997/11/17 / 10.49.36 = 000879760176 casto
r 0879760177.00000 # NOTSTARTED → RUNNING 0879760177.00001 S 000000 1199 020 0 0879760179.00000 L 1 43391 Eigil 156.116.2.222:43391 ok 0879760179.00001 B 1 00001 000000 879760179.854896 accepted 0879760179.00003 S 000001 020 020 1 0879760180.0000 0000 0001 000 8000 -01 019 32 0879760243.00000 Q 000001 0879760249.00002 # auction over: 879760237

At the end of the auction, Auctioneer prints a result file consisting of an initial identification line, a header line, and a line allocated one line for each active bidder. Each row contains the bidder's numeric id, the bidder's name, the final result, and the number of bids.

Example: #. auction (0.9) 1997/11/17 / 10.49.36 = 000879760176 castor # id who result bids 000000.0 0 000001 Eigil -8 8 000002 Tom 17 8 000003 Eirik -8 8 000004 Brynjulv -8 8

[0069] 6. Source code # Date Fri Nov 7 13:18:45 MET 1997 # wc bids.c commands.c log.c main.c payoff.c player.c rungame.c util.c
game.h 137 481 3152 bids.c 135 425 2783 commands.c 39 104 765 log.c 164 650 4813 main.c 113 446 2477 payoff.c 108 426 2732 player.c 200 640 4643 rungame.c 133 439 2954 util. c 128 541 3287 game.h 1157 4152 27706 total main.c Main program for auctioneer rungame.c Actually execute the auction bids.c Commands.c command (login and exit) to control the input of bids (incoming bids) Payoff.c Executes the current rules for payoff at the end of the auction player.c Reads / generates player data structure log.c Executes login function util.c Various utilities game.h type Definitions (typedefs) and declarations client.c A program that creates one or more clients

[0070] 7. Security Matters 7.1 Initialization Here the auctioneer program shall be started by the smallest web server running on the same machine as the auctioneer. This minimal web server communicates with the main management web server using SSL and forwards the Java code to the authenticated client (participant).

7.2 Bid During the auction, participants send bids and the server sends receive and status messages. Message loss is part of the game. Cheaters do not have the right to see the message exchanges, but can listen, and may inject fake messages into the message stream.
Fraudsters can resend real messages or "junk bytes"
May be inserted in the message stream. Authentication and encryption techniques are used to secure complete messages at substantial expense during processing time. The simplest approach is for the auctioneer to share a secret key with each player. This key is used to encrypt and decrypt receiving, bidding and status messages. It is believed that there is no special reason to keep the message content confidential, but if so, each message can be signed and a key used.

7.3 Overload Examples of attacks include the following: A participant decides to bid. Upon receiving the received message, launch one or more programs to prevent other participants from bidding through the server. These programs can send as much junk data to the auctioneer as possible. A countermeasure against such an attack is to delay the clock when the server receives the burst junk.

7.4 Distribution of Results The server writes the results and logs to a file. FIG. 6 shows an example of the sequential file. Administrative routines must ensure that these files are kept for the required period of time and that they have not been tampered with.

[0074] 8. Other preferred features-Auctioneers should minimize the number of status messages sent. The auctioneer must provide the signed (or encrypted) message. As a method for signing a message, there is a public domain C implementation of MD5.・ Auctioneers must control overload appropriately. Appropriate techniques for controlling overload must be identified and implemented. -It can be confirmed that the auction has been completed within an appropriate time. Techniques for closing the auction at the appropriate time must be identified and implemented.

Other Embodiments of Auction A) "Real Time"-Interactivity (See FIG. 8 ) FIG. 8 shows an example of implementing a computer network auction system in real time. The clock represents the start time of the auction, which is signed before the participant purchases a predetermined number of bids. The "rolling film" indicates a time period during which the auction is executed, and any participant can successively perform his / her bid in a continuous time period from when the auction hammer is swung down to when the auction ends. The rolling film can also represent a log of the auction process, and the log can be played back later.

A real-time auction is conducted bi-directionally, starting at a predetermined time in “real time” and ending when a participant makes a successful bid. (It is exactly the same as a "normal" auction.) Bid is pre-purchased and used at the will of the participants during the auction.

The length of the auction depends on the number of participants allowed and the number of bids per participant.
It is important to limit the auction time by limiting the number of bids (participants and / or bids), since theoretically the auction can continue indefinitely. A reasonable maximum bid is 2500 bids (ie, 5 bids per person and 500 participants). The auction does not start until bidding has begun. Since no one seems to want to be the first bidder, the auction machine uses 1 to start the bidding process.
Has a bid (only the first bid). A bid is awarded when there is no other bid within a predetermined second. Set the time zone to 30 seconds at the start (timer count displayed on the participant's PC screen-visible by the down meter (auction hammer is dropped))
. To limit the total auction time, the variable (30 seconds to successful bid) may be reduced to 20 or 10 seconds, depending on the time at which the auction is entered, thereby increasing auction tension and participant excitement and increasing the auction time. Is significantly reduced.

Security / Security Functions, Jamming Prevention / Response Methods Participants must be protected from unauthorized activities in network auctions. Also, coping procedures must be developed in case of technical failure / loss of a large number of participants. Technical failure, ie loss of connection with a certain number (a large number) of participants,
Alternatively, if the server is overloaded, the auction will stop. A random number of bids are "erased" from legal bids and returned to the bidder. With such a manipulation, no one can predict which bid will be the last bid. The auction resumes when "clean-up" or online connection is re-established. Auctioneers always go online with at least n% of participants. If such a limit is exceeded, the auction will stop and the connection must be re-established.
The auction will continue once the connection is re-established. Regarding the problem of obstruction, “java-applet” was “On-line check” (on-line che
ck) has a function of continuously sending (artificial) messages. Outsider(
The manipulation is complicated because the outsider / manipulator cannot distinguish these checks from real bids. In addition, the traditional "fire-wal
"ls" runs as an auctioneer server, performing the most supported security for encoding. Currently, the 56-bit DES-algorithm is recognized as a commercial application made in the United States. This security code is for example compared to the code currently used by the Bank of Norway. The auction will be stopped in a similar manner as described above, in order to eliminate bidders who are plotting jamming, a random number of bids will be canceled, and jamming bidders will be removed.
Is eliminated and the game is restarted.

Optional Features By adding the following three items, the auction can be made entertaining to the participant (to be recognized) or the auction function can be set in other games. To -Interactive-Design-Strategic games (log-analysis of each strategy after the auction ends-comparing each participant / winner-or changes during the auction)-Interactive Auctions are all of the other participants It is a complete "real-time" interaction that sees and reacts to your actions. -Design

As pure entertainment, the action of participants is a themed story (theme-
background) visualized along with stories). The story reflects the participants' actions and is also interactive with the auction actions. The theme is not limited as long as the theme (or action in the story) can be easily associated with the auction action, such as "auction with auctioneer-theme, gold coin machine, etc.", dragon and dungeon, war game, etc. The participant can select other functions from the background story and the preferences that the participant can enjoy. -Strategy Various strategies can be selected to participate in the auction. The (ultimate) point of the auction is to have a bid lasting 30 seconds (or as long as the auction rules stipulate for the winning bidder). In the following, the strategies we presently consider are presented in a table with respect to the likelihood that each participant will win a bid while being influenced by the strategies of the other participants.

[0081]

[Table 1]

From the above table, in order to obtain a chance to win a bid, the participant needs
It turns out that it is important to be anti-cyclical to the strategy. At the beginning of the auction, the strategy may change at each time of the auction (at the start / intermediate / end), such as performing an "action" strategy at the end, and so on. One or more strategies must be planned.

The auction log comparing the average of the strategies of the participants / successful bidders with the strategies of the respective participants is fed back as a strategy in the next auction. Expect this feedback to be understood as "educational" / "learning experience", or completely entertaining, even if the strategy for winning in one auction becomes a loosening strategy in the next auction I do.

Finally, the auction log can be used to define: 1. 2nd / 3rd (following the winning bidder) 2. Successful bidder's strategy 3. Optimal strategy-early / mid / late auction 4. Total time at successful bid position 5. Number of waiting bid rounds ("Stay cool") Number of simultaneous bids As with many games, limiting the number of participants increases the chances of winning, resulting in attractive bids.

Market Segmentation: First Stage Segmentation: Participants must have access to a PC or other interface device. Second stage segmentation: bidding cost (ie, affluent and average segments are covered based on this variable) Example: rich: 100/1000 USD bid (5 bids in one auction, Total cost is 500/5000 USD) Average: 1/20 USD bid (5 bids in one auction, total cost is 5
/ 100USD)

B) Simulation 1 Non-Interactive, See FIG . 9 FIG. 9 is similar to FIG. 8, but relates to a “simulated auction” implementation. In this embodiment, the auctioneer computer (a computer shown in the center of the figure) when a bid at the indicated time is received from all participants.
Calculates the result immediately. A log is also prepared at the same time, and this log (short "
The "film roll") can be removed at any time later by the participant. This is an auction version for participants who want to be free to choose the time to participate, so that they do not have to wait during the auction process, ie, bidding or auction. The advantage of this auction (as viewed from the organizer) is that it is completely flexible with respect to meeting market demands, as the next auction starts as soon as the previous auction closes. This simulated auction is non-interactive and the number of participants is limited. Participants register and purchase bids and bid on their own until a flexible start time (time for a predetermined number of participants to register and bid). The number of bids / participants is set before bidders register and participate. Therefore,
As soon as the predetermined number of bids have been placed, the participants start a true offline / non-interactive auction.

The server creates a time simulation string based on the number of bids allowed (a function of bids per participant). This is divided into blocks, and sufficient blocks (unused blocks) are prepared in consideration of the space between bids. That is, any bid is awarded at the start / intermediate or end of the auction. This procedure is a complete replica / simulation of the "real time" auction except for the interactive elements. That is, a participant cannot respond to other participants in this auction during the auction. Otherwise, the criteria for selecting the winning bidder are exactly the same. When a bid starts and all bids are closed, the auction equipment immediately simulates the time and conducts an auction based on the entered bid. Thus, the winning bidder is determined. When the successful bid ends, the participant can participate in the organizer's homepage and collect the auction log and the visualized auction. Each participant can view their bid price and its duration on the screen. With a limited number of bids per player, the entire auction can be visualized in 5 minutes. As for the length of the auction, the actual simulation is immediate. However, participants will spend time bidding. It is completely separate from what was done. Because it depends on a fixed number of bids, it is not known when the auction will actually take place on the auction equipment. This auction can be held at any time, but there may be delays in determining the winning bidder. Since time is simulated, the problem of first bidding does not appear. There is always a first bid, and the auction starts. If there is no other bid within a predetermined number of seconds, the bid is awarded. Initially, this time is set to 30 seconds. The simulation of the number of seconds between each bid is performed by assigning the number of seconds to each block (the position where the bid is allowed). Since there are more blocks than bids allowed in the time string (total auction time), there may be open spaces / blocks between the two bids indicating 30 seconds, and therefore the winning bidder May appear before the end of time. The trick is to estimate the number of blocks relative to the number of bids, and depending on the overall bidding strategy, will allow the winning bidder at the start / middle and at the end (final bidder). Such protection can be problematic if participants can operate the auction equipment before the auction begins. However, when determining the successful bidder of the time simulation / auction, since it is performed off-line, disturbance / operation from an external source cannot be performed.

Optional Features: This auction implementation uses auction equipment and is completely non-interactive and offline, so there are no interactive features of other auctions.
However, other features may be provided that provide an interactive aspect (see below). One or more of the following items will make an auction attractive or entertaining,
Should be present at the auction.

Simulated interactivity The auction is completely non-interactive in all phases. However, as described above, it is possible to create a two-way appearance by using the pop-up theme during each player's play in exactly the same manner as described in “Simulation 2” below.

Design Purely entertaining features are background designs that visualize participant actions by theme-story. The story is simpler than the “real-time” version (during the bidding process) and cannot interactively reflect the actions on the diagrammatic “bidding board” if the bidding has been done for 15 minutes. However, it is important to give an interactive impression, or at least an action impression. However, this is misleading (because there is always a participant who does not bid, which affects the strategy for each participant after each participant places a bid), It cannot be done by action. Therefore, the theme design needs to interact with other parameters compared to the actual bid. You can take out your own logs from past auctions and guide your current bidding as well as the background story. Another feature is that the participant can choose from a variety of background stories, which allows the participant to be very enthusiastic, or to completely remove the theme story and concentrate 100% on the bidding process.

• Strategy Similar to the “real-time” embodiment. If the number of participants is limited, as in many other games, the chances of winning are higher and attractive bid values are obtained. Market Segmentation: First Stage Segmentation: Access to PC. Second-stage segmentation: bidding costs (ie, affluent and average segments are covered based on this variable), and time is limited / time to play "real-time" auctions There is no.

C) Simulation 2 Non-Interactive / Cognitive (Partial) Bi-directional, see FIG . 10 FIG. 10 shows an embodiment that is an intermediate solution to that shown in FIGS. The participant does not actually participate in the interactive auction, but still has the specified time indicated by the two clocks and bids in accordance with that time. "Split" film rolls indicate non-interactive bidding at the time of bidding. The device on the right side of the figure instantly calculates and shows the auction result after the end of the bidding time, and the short "film roll" on the far right is a log that can be taken out anytime after the end of the auction. This type of simulated auction is non-interactive and has an unlimited number of participants. Participants register and / or purchase their own bids by a predetermined start time, but bid during the time limit (bid time). Once the number of bids / participants is known (starting point), the auction server creates a time simulation string. It is divided into blocks (
Simulate the auction) and provide enough blocks to take into account the space between bids (ie, there is a gap between each bid so that any bid is won either at the beginning / mid or late of the auction. If so, any bids in this string will be awarded). Participants can spend 10/15 minutes in the string when bidding, and the bidding can be visualized multidimensionally to facilitate bidding on the coupon. When a bid is placed (within the allowed bidding time), the auction equipment immediately /
Instantly simulate time (auction) and determine the winning bidder. As soon as the winning bidder is "calculated," the auction is visualized and bid activity is shown on the timeline with each bid via the meter. Each participant can see his bid price and its duration on the screen. If the number of bids per participant is limited, the entire auction can be visualized in about 5 minutes regardless of the number of participants. The length of the auction has nothing to do with the number of participants / the number of bids. That is, the time for bidding is fixed (online, non-interactive). The total time of the auction, including the time of visualization, is about 15/20 minutes.

An advantage of this auction implementation is that participants who do not have time to participate in “real time” (or who wish to participate in a second auction after “real time” play) can participate in this auction. It is. Since time is simulated, the problem of first bidding does not appear. There is always a first bid, and the auction is started. If there is no other bid within a predetermined number of seconds, the bid is awarded. Initially, this time is set to 30 seconds. The simulation of the number of seconds between each bid is performed by assigning the number of seconds to each block (the position where the bid is allowed). Time string (
Since the number of blocks is greater than the number of bids allowed in the (total auction time), there may be open spaces / blocks between the two bids indicating 30 seconds, so the winning bidder is Sometimes it appears in. The trick is to estimate the number of blocks relative to the number of bids, and depending on the overall bidding strategy, will allow the winning bidder at the start / middle and at the end (final bidder).

Obstruction / Unauthorized Access-Protection Such protection can be problematic if participants can operate the auction equipment before the auction begins. When determining the successful bidder of the time simulation / auction, since it is performed offline, no interference / manipulation from an external source can be performed.

Optional Features: All three things add (or are perceived) entertaining value to participants and set up this auction like the other game types described above.・ Interactivity ・ Design ・ Strategy auction (log-analysis of each strategy by comparing with other participants / successful bidders after auction or at auction)

Interactivity This auction is one of the options for those who are not ordinary in the normal sense (like the “real-time” version), but do not have enough time to do the interactive version. . The auction takes place (bids) at a given time,
Since the visualization is performed in a "modified real time", the participant thinks that he / she participates in the auction interactively when viewing / visualizing.

Design Purely entertaining features are background designs that visualize participant actions by theme-story. The story is simpler than the "real-time" version, and cannot interactively reflect actions on the schematized "bid board" if the bid has been for 15 minutes. However, it is important to provide interactivity or at least an impression of action. However, this is misleading (because there is always a participant who does not bid, which affects each participant's strategy after each participant places a bid), It cannot be done by action. Therefore, the theme design needs to interact with other parameters compared to the actual bid. You can take out your own logs from past auctions and guide your current bidding as well as the background story.

[0098] Another feature is that the participant can choose from a variety of background stories, which makes the participant very enthusiastic or completely removes the theme story and concentrates 100% on the bidding process. • Strategy Similar to the “real-time” embodiment. -Prize money (pot) / winning chance Since the number of participants is not limited, the chance of winning is less than that of a "real time" auction, but the prize money is considerably higher. Market Segmentation: First Stage Segmentation: Access to PC Second Stage Segmentation: Bidding Costs (ie, Affluent and Average Segment Covered Based on This Variable), and Time Limit for Play

Screen Activity Level (Visualization): The visual story (theme) on the screen experienced by the participant needs to be created interactively with actions that interact with the levels changing according to the auction activity. . Basically, there are four levels to interact with individually, as shown below. The fifth is "just for entertainment". -Settings (general theme)-Auctioneers-Total number of participants ("competitors"-everyone except you)-Individual participants (feedback to each action)-Humorous "pop-ups" (sit-com)-(through auction) (Distributed randomly), just for entertainment as well as “confused elements”

Items / Information Communicated to Participants During Auction Particularly in a real-time computer network auction implementation,
Also, in the simulation embodiment, the following information is noteworthy by the participant, and any or all of the following features should be transmitted to the participant's PC. -Timing of bid rounds (fixed, random or continuous)-The random case is considered the most exciting, in which case the countdown meter (to successful bid) is randomized from 30 seconds to 20 seconds, 15 seconds at auction Shift to This increases excitement and demands high concentration through the auction. -The life of each bid-The number of bids (whole and individual)-The number of bids (whole and individual)-The number of bids (whole and individual)-The total number of bids (whole and individual)-The number of participants-The prize money ( pot) size

Log Parameters: Logs are intended to be a guide for participants and inform participants about their action / non-action information and how it affects their chances of winning. The log also informs the participant of the participant's strategy compared to the optimal / winning strategy, and suggests alternative strategies that may be helpful in the next auction. Therefore, the participant is given a feeling of a chance to win a bid, regardless of whether or not the bid was successful this time. The auction log is accessible after the auction ends. We expect that the auction log also has independent entertainment value and can be visualized on the participant's PC screen.

The following elements will be (or are considered) included in the log:・ You are the successful bidder. -The time each bid lasted (before the competitive bid was made)-The time that all bids lasted-The number of rounds that remained cool (the "standby" position at the end of the round / total accumulation round)-The cool Number of times (accumulation) ・ Number of times using the same strategy as others (act within the same “second” as others, number of others) ・ Number of times using different strategies (defined as “different”) ・ Optimal Strategies vs. Your strategy-The winning bidder's strategy vs. Your strategy • Alternative winning strategies in this auction (good advice for the next game) Ideas for the theme: Alternative themes include, for example:・ Auction using “Einstein,” an anthropomorphic auctioneer ・ Auction at a steamship-style building (c. 1870) along the Mississippi River ・ Auction at a Scottish castle ・ “Indiana Jones”-Obstacle Course-Raw / Death (Holy Grail search)-Traditional auction (using sit-com pop-up)-Casino environment / advanced society-Straight auction coupons (like lots), "No Fuzz" version of simulation auction-Other

Sit-com / pop-up: Sit-com can be a special recognition feature for organizer auctions (eg, Gary Larson's “The Far Side”) and for advertising at auction Can also be used. Ideas constantly create new pop-ups. Pop-ups add amusement value to the auction while confusing participants. Pop-ups must be fun and comical, which hinders the participant's concentration, but makes it fun to participate in the auction (compensates for loss of concentration and possibly loss at the auction) . Random sit-coms should not appear too often and should appear / disappear in, for example, 5/6 seconds. Pop-ups can appear in "real time" and especially in simulated versions of the auction, making them more "interactive" and interesting / entertainment.

FIG. 11 shows the various parties / objects associated with the auction system of the present invention in a general manner, and similar to FIG. Two or more objects can be interconnected to open or closed communication, analog or digital. In addition to the participant's PC and auctioneer server, which have been widely dealt with above, the following possibilities are also described. A video / automaton auction can be implemented over a network connection to an auctioneer server, and a complete auction system can be implemented inside such an automaton, with the auction type being with other simulated participants. (Such a free-standing automaton can be realized even with a small device such as a hand-held device.) However, it goes without saying that the automaton can operate as a terminal like a PC. One way to conduct an auction in accordance with the present invention is to connect to a TV or radio show. In this case, a normal TV channel, a text TV channel or a radio channel (public or closed circuit) can be used as a means of the communication network, ie as a participant informing the participants of the progress of the real-time auction. . The participant can use, for example, a telephone network (cellular phone or public network) as a network means for making a bid, i.e. sending a bid message to Auctioneer. Thus, a telephone, radio and TV are shown in the figure together with a telefax, which can be an interface unit in connection with a telephone network. It is also worth noting that digital television networks allow two-way communication, and therefore can return messages using a touch screen or a hand-held remote controller or the like.

Lastly, for example, in a TV show, usually the spectator can also be an auction participant and an interface unit for participating in the bidding session (
Wireless or wired) connected to an auctioneer computer. FIG. 12 shows an example of a "bid board" that can be used in connection with the "immediate" type auction shown in FIG. Such a bidding board can be provided on a PC screen or on an automaton or the like. Entering a bid value, ie marking a specific time point, is easily accomplished by moving the hour, minute and second positions within the three scales / dialings shown and confirming the desired time point. After entering all allowed bid values, all bid packages are sent to "SEND
Use the "" button to send to Auctioneer. One of the features here is “cumulative bid value”. This shows the total value of all the bids made so far at the time of participating in the bid, whereby the participant gives an idea of a winning prize (pot).

[Brief description of the drawings]

FIG. 1 shows an overview of the basic elements of a computerized auction system according to a first aspect of the present invention.

FIG. 2 illustrates the characteristics of the network server hardware and software platforms that make up the basic elements of a computerized auction system according to the first four aspects of the present invention.

FIG. 3 illustrates the characteristics of the network client hardware and software platforms that make up another basic element of a computerized auction system according to the first four aspects of the present invention.

FIG. 4 shows an outline of an auction system according to a first aspect of the present invention.

FIG. 5 shows a flow diagram illustrating some of the steps required in the method according to the invention.

FIG. 6 is a communication chart showing a connection between an arbitrary client and an auctioneer game engine.

FIG. 7 is another communication chart focusing on the connection between the auctioneer server and the closest part of the communication network.

FIG. 8 shows events that occur in the real-time version of “American Auction”.

FIG. 9 shows the events that occur in the “immediate” version of “American Auction”.

FIG. 10 shows events that occur in the “Strategy / Simulation” version of “American Auction”.

FIG. 11 schematically shows all possible communication network connections between participants in an auction according to the invention.

FIG. 12 shows an example of a bid board screen for an auction participant in a shielded bidding auction.

[Procedural Amendment] Submission of translation of Article 34 Amendment of the Patent Cooperation Treaty

[Submission date] December 20, 1999 (December 20, 1999)

[Procedure amendment 1]

[Document name to be amended] Statement

[Correction target item name] Claims

[Correction method] Change

[Correction contents]

[Claims]

──────────────────────────────────────────────────続 き Continuation of front page (81) Designated country EP (AT, BE, CH, CY, DE, DK, ES, FI, FR, GB, GR, IE, IT, LU, MC, NL, PT, SE ), OA (BF, BJ, CF, CG, CI, CM, GA, GN, GW, ML, MR, NE, SN, TD, TG), AP (GH, GM, KE, LS, MW, SD, SZ, UG, ZW), EA (AM, AZ, BY, KG, KZ, MD, RU, TJ, TM), AL, AM, AT, AU, AZ, BA, BB, BG, BR, BY, CA, CH, CN, CU, CZ, DE, DK, EE, ES, FI, GB, GD, GE, GH, GM, HR, HU, ID, IL, IS, JP, KE, KG , KP, KR, KZ, LC, LK, LR, LS, LT, LU, LV, MD, MG, MK, MN, MW, MX, NO, NZ, PL, PT, RO, RU, SD, SE, SG, SI, SK, SL, TJ, TM, TR, TT, UA, UG, US, UZ, VN, YU, ZW

Claims (53)

[Claims] In a computerized auction system, a bid transmitted from a participant in an auction is processed, and the receipt of the bid and details of the status of the auction are transmitted to the participant and received. Auction means for determining a successful bidder from among the participants based on the bid and transmitting the successful bidder to the participants; and separately transmitting the bidding from each of the participants to the auction means;
A bidding means for receiving the bid transmitted from the auction means and processing details of the status of the auction; and a network means for providing a communication transmission path between the auction means and the bidding means; The information transmitted between the means and the bidding means through the network means is in accordance with at least one of a first transfer protocol and a second transfer protocol, wherein the first transfer protocol transfers the information. The second transfer protocol is more reliable than the second transfer protocol with respect to ensuring that representative data arrives at one of the auction means and the bidder means. Means, said auction means and said bidder -In terms of the time it takes to be received by one of the means, faster than said first transfer protocol,
Here, the risk associated with the information transmitted under the second transfer protocol is that the data is lost while being transmitted through the network means, one of the bidding means and the auction means respectively. The data arrives at one of the auction means and the bidder means in an order different from the temporal order in which the data was sent from, and the data arrives at one of the auction means and the bidder means. A computerized auction system, comprising overlapping data, wherein said risks are an aspect of said auction relating to determining said winning bidder among said participants. 2. The auction system according to claim 1, wherein said bid is transmitted from said bidding means to said auction means under said second transfer protocol. 3. The auction means includes auctioneer means for processing the bid transmitted from the bidder means, and transmitting to the bidder means the receipt of the bid and details of the status of the auction, the auctioneer means comprising: 2. The auction system according to claim 1, wherein information is transmitted to and from said bidder means under said second transfer protocol. 4. The auction system includes management means for processing the participant's account and processing information relating to the auction, which is different from information transmitted between the auctioneer means and the bidder means. The auction system according to claim 3. 5. The auction system according to claim 4, wherein said managing means further includes means for processing contents in the form of a World Wide Web page communicating with said bidding means. 6. The auction means includes auction support means for prompting the auction means to start the auction, wherein the auction support means establishes a transmission path outside the network means or via the network means. 5. The auction system according to claim 4, wherein information is transmitted to the management unit on a secured communication channel. 7. The auction system according to claim 6, wherein said auction support means further includes means for storing a result of said auction. 8. The auctioneer means and the auction means both include a first computer network server connected to the network means, and the management means includes a second computer network server connected to the network means. 7. The auction system according to claim 6, including: 9. The network means includes a telephone network, a public postal network, a telefax network, a corporate information network (LAN).
, And the Internet, wherein the first transfer protocol includes a Transmission Control Protocol / Internet Protocol (TCP / IP), and the second transfer protocol includes a User Datagram Protocol (UDP). The auction system according to claim 1. 10. The network means includes the Internet, and the first transfer protocol is a transmission control protocol / Internet protocol (TCP / Internet protocol).
6. The auction system according to claim 5, wherein the second transfer protocol comprises User Datagram Protocol (UDP). 11. The auctioneer means communicates information with the bidder means under the UDP, and the management means communicates information with the bidder means under the TCP / IP. The auction system according to claim 10, wherein the auction support means communicates information with the management means under a secure socket layer (SSL). 12. The information communication with the auctioneer means under an auction protocol in a higher layer (hierarchy) of one of the first and second transfer protocols. 3. The auction system according to 3. 13. The auction system of claim 12, wherein the auction protocol includes an auction management and bidding protocol. 14. The auction management protocol, wherein the participant's name,
Identification of an access communication port to the auctioneer means by the bidder means in each of the participants, identification of the successful bidder among the participants, time reference of the auction, start time of the auction, end time of the auction, The time at which the latest of the bids will be the final bid, the number of bids accumulated at one time, the number of bids made by a particular one of the participants to submit to the auction, and 14. The auction system of claim 13, including a parameter that includes a time at which one of the bids must be maintained at a maximum to be won. 15. The bidding protocol may include: a price of the bidding, a number of messages of each of the participants received by the auctioneer means from the bidding means, an idea of a time of the auction by each of the bidding means, the participants Of the successful bidder, the start time of the auction, the time at which the auction ends and the latest one of the bids becomes the final bid, the number of the bids transmitted to the auctioneer means at a time, 14. The auction system of claim 13, including parameters including the number of bids placed by the participant, the time one of the bids must survive to win the auction, and the number of participants. 16. A computer network auction system server, means for processing a bid transmitted from an auction participant over a computer network; and wherein said participant in response to said bid transmitted from said participant over said computer network. Means for transmitting information to the participant, means for determining a winning bidder among the participants based on the bid received through the computer network, and means for transmitting the successful bidder to the participant through the computer network. Means for a first transfer protocol under which said means for transmitting information and said winning bidder are transmitted, said bid being transmitted from said participant through said computer network under said protocol Second transfer Means for the transmission of information is more reliable under the first transfer protocol than the second transfer protocol, with respect to the transmission of the information reaching its destination, With respect to the time from the first transmission to the arrival at the intended destination, the transmission of information is faster under the second transfer protocol than the first transfer protocol, wherein the second transfer The risks associated with the transmission of information under a transfer protocol are that the bid is lost during transmission over the computer network and the order in which the bids are sent from each of the participants is different. The risk that the participant's bid arrives and that at least one of the bids arriving at a given destination overlaps, in that order. The has a one surface of the auctions to means, computer network auction server to determine the winner from among the people. 17. The computer network auction server according to claim 16, further comprising management means for processing the participant's account. 18. The computer network auction server of claim 17, wherein said managing means further comprises means for processing content in the form of a World Wide Web page communicating with said bidding means. 19. The method according to claim 16, wherein the first transfer protocol comprises a Transmission Control Protocol / Internet Protocol (TCP / IP) and the second transfer protocol comprises a User Datagram Protocol (UDP). A computer network auction server according to claim 1. 20. The bidder of claim 16, wherein the bid is communicated from the participant under an auction protocol on a higher layer of one of the first and second transfer protocols. Computer Network Auction Server. 21. The computer network auction server of claim 20, wherein the auction protocol comprises an auction management and bidding protocol. 22. The auction management includes: a name of the participant; an identification of a communication port for accessing the auctioneer means by the bidder means in each participant; an identification of the successful bidder among the participants; Time reference, the start time of the auction, the end time of the auction, the time when the latest one of the bids is the final bid, the number of the bids accumulated at one time,
Parameters including the number of bids made by a particular one of the participants to submit to the auction, and the time that one of the bids must be maintained at a maximum to be awarded. 22. The computer network auction server of claim 21, comprising: 23. The bidding protocol, wherein the bid price, the number of each participant's message received by the auctioneer means from the bidder means, an idea of the time of the auction by each bidder means, the participant Of the successful bidder, start time of the auction, time at which the auction ends and the latest one of the bids becomes the final bid, the number of the bids transmitted to the auctioneer means at a time, 14. The computer network auction of claim 13, comprising parameters including a number of bids placed by the participant, a time at which one of the bids must survive to win the auction, and a number of the participants. server. 24. A method of implementing an auction system over a communication network, comprising: transmitting a bid to the auction computer device through the network by an input computer device of each participant in the auction; and receiving the bid by the auction computer device in the previous period. Processing the bid, providing the receipt of the bid to the input computer device by the auction computer device through the network, and based on the bid received from the input computer device by the auction computer device. Determining the winning bidder from the participants; transmitting the winning bidder among the participants to the input computer device by the auction computer device; Providing first and second transfer protocols in which the transmission of information between the auction computer device and the input computer device is performed under these protocols. The first transfer protocol is more reliable than the second transfer protocol in reaching the intended destination and is sent through the computer network and at least one of the input computer device and the auction computer device. The second transport protocol is faster than the first transport protocol in terms of the time it takes to transfer the information it receives, wherein the risks associated with transmitting the information under the second protocol are: Losing transmission of said information in said network;
The transmission of the information arriving at one of the input and auction computers in a different order than the temporal order in which the transmission of the information was sent from each of the input and auction computers; and A method, wherein the communication of said information arriving at one of an auction and an input computer comprises duplication, wherein said risk is an aspect of said auction relating to determining said winning bidder among said participants. 25. The method of claim 24, further comprising processing the participant's account. 26. The method of claim 24, further comprising storing a result of the auction. 27. The method of claim 24, wherein said network comprises one of a public postal network, a telephone network, a telefax network, and a computer network. 28. The method according to claim 28, wherein the network includes the Internet, and wherein the first transfer protocol is a transmission control protocol / Internet protocol (TCP / IP).
), Wherein the second transfer protocol is a user datagram protocol (U
25. The method of claim 24, comprising DP). 29. The bidding between the auction computer device and the input computer device under an auction protocol in a higher layer (hierarchy) of one of the first and second transfer protocols. 25. The method of claim 24, comprising performing a communication of information about. 30. The method of claim 29, wherein the auction protocol comprises an auction management and bidding protocol. 31. The auction management protocol comprising the steps of:
Identification of an access communication port to the auctioneer means by the bidder means in each participant, identification of the successful bidder among the participants, time reference of the auction, start time of the auction, end time of the auction, The time at which the latest of the bids will be the final bid, the number of bids accumulated at one time, the number of bids made by a particular one of the participants to submit to the auction, and 31. The method of claim 30, including a parameter including a time at which one of the bids must be maintained at the highest value in order to be won. 32. The bidding protocol, wherein the price of each bid, the number of messages of each of the participants received by the auctioneer means from the bidder means, an idea of the time of the auction by the individual bidder means, the participation Identification of the highest bidder among the bidders, the start time of the auction, the time at which the latest auction is completed and the latest bid is the final bid, the number of the bids transmitted to the auctioneer means at a time, 31. The method of claim 30, including parameters including a number of bids placed by each participant, a time at which one of the bids must survive to win the auction, and a number of the participants. 33. A method of conducting an auction on a computer network server, comprising: processing a bid transmitted from a participant of an auction through a computer network; and transmitting the bid transmitted from the participant through the computer network. Communicating information to the participant in response to: determining the winning bidder from the participants based on the bid received through the computer network; and Communicating said successful bidder out of said first and second transfer protocols through said computer network under one of said first and second transfer protocols. And from the second transfer protocol The reliability of the arrival of the information at the intended destination is high, but time consuming, and the risk of loss, delay, duplication of information transmission under the second transfer protocol increases the risk of the successful bid among the participants. A method that is an aspect of the auction with respect to determining a party. 34. The method of claim 33, wherein the first transfer protocol comprises a Transmission Control Protocol / Internet Protocol (TCP / IP) and the second transfer protocol comprises a User Datagram Protocol (UDP). Method. 35. The participant according to claim 33, wherein the bid is transmitted from the participant under an auction protocol on a higher layer of one of the first and second transfer protocols. the method of. 36. An auction system based on the presentation of stake-supported bids from auction participants within a preset time limit, for transmitting information between auctioneers and participants. Said auction system, which can include a communication network;-interface means adapted to present bids from participants;-detector means for detecting bids submitted by each participant; A real or simulated clock indicating the start and end times and recording the auction execution time as well as the time of bidding detection in the detector means; and determining means for determining the result of the auction, Auction system where the result is expressed as a function at the time of bidding Stem. 37. The determining means determines whether a predetermined time or a time varying according to a predetermined rule has elapsed since the last bid without detecting a new incoming bid. If no new incoming bid is detected after the last bid, the participant who placed the last bid found is identified as the winner of the auction, 37. The auction system of claim 36, wherein otherwise, the participant who submitted the last bid before the end time of the auction is identified as the winning bidder. 38. The method according to claim 36, wherein the interface means may be a computer terminal attached to a real-time data transmission communication network via a modem, wherein the auctioneer is then attached to the same network by a similar computer terminal. The described auction system. 39. The auction system of claim 38, wherein the auctioneer clock, detector means and decision means are included in an auctioneer computer adapted to process an auction according to a programmed auction algorithm. 40. An auctioneer computer algorithm filters bids presented in real time by participants during the auction, and the computer can make corrections in the event of a transmission delay from the participant's computer terminal. An auction system according to claim 39. 41. One of the auctioneer computer algorithms comprises:
41. The auction system of claims 37 and 40, wherein the auction system is an algorithm that varies the length of time as a function of elapsed time of the auction, or as a function of a current bid submission rate from all participants. 42. The participant's computer terminal and communication network are enabled to transmit information from the auctioneer computer in real time to present to each participant the ongoing auction progress and activities,
The auction system according to claim 40. 43. The algorithm of the auctioneer computer can process bids submitted by each participant as a group within a fixed time, after which time the computer will immediately proceed with the auction. 40. The auction system according to claim 39, wherein the whole can be simulated. 44. The total number of bids during an auction can be predetermined, and the auctioneer computer algorithm is submitted by each participant at the same time that the participant enters or pays for the auction. 44. The auction system of claim 43, wherein the auction system can be adapted to process bids. 45. If no limit is placed on the total number of bids in the auction, the auctioneer computer algorithm may be configured to: a) pay bids from each participant within a predetermined time / entry into the auction; b) Then, calculate the time of the entire auction, ie, the length of time from start to end, c) setting a time limit for the presentation of grouped bidding times from each participant, and d. ) Following receipt of bids from participants and expiration of the time limit,
44. The auction system of claim 43, wherein a simulation of the entire auction process can be performed. 46. The auctioneer computer, the participant's computer terminal, and the communication network each display information about the progress of the simulated auction on a screen in real time or on a converted time scale. 46. The system of claim 43 to 45, which can be transmitted to a participant.
The auction system according to any one of the above. 47. The auctioneer computer shall also transmit auxiliary information to the participant's computer terminal according to special programming, wherein the auxiliary information includes: (a) enhancing the attractiveness of the auction; For purposes, next to or in the background of auction information, images / audio, or related to the auction,
Controlled by an auctioneer clock and, if possible, in accordance with an ongoing auction development, during a real-time or simulated auction, to display an entertaining or distracting short video; 47. An auction according to claim 42 or 46, wherein (b) during the auction entry / payment / primary bidding stage, information about entertainment or auctions or ancillary information including animations including advertisements. system. 48. The auctioneer computer has a memory for accumulating the entire history of the auction so that participants can display data on the progress of the auction on their computer terminals automatically or as soon as the auction ends. 40. The auction system of claim 39, including: 49. At least one participant is a genuine participant and the plurality of participants are simulated participants, and the system is further simulated according to a predetermined random number generation algorithm. Auctioneer random number generating means for controlling the number of participants and their bidding times, wherein said algorithm includes adjustable parameters to adjust the probability of winning the auction to a range consistent with national laws. Item 36. The auction system according to Item 36. 50. A part of said communication network is any of a public telephone network, a mobile telephone network, a computer network and a reverse TV channel network; and said interface means comprises a general telephone, a mobile telephone, a telefax The unit, a computer terminal, and a television capable of two-way communication; the auctioneer broadcasts any of a radio program, a television program, and a teletext television program through the other part of the communication network. The other part is constituted by any of public radio channels, television channels and closed-circuit networks, in which real-time information on the progress of the auction of radio / television / teletext television programs is sent. Contract Section 3
The auction system according to 6 or 37. 51. The interface means includes information about a coupon that is filled in by each participant and sent to the auctioneer, wherein the coupon is within a predetermined time frame and is desired for the participant. When there are a large number of bids determined according to rules and stakes, the detecting means is a coupon reading unit, the determining means is a programmed computer attached to the coupon reading unit, and the watch is 37. A simulated clock, according to which bids from participants are time-ordered, wherein the communication network is a public postal network, a telephone network, a telefax network, or a computer network. Auction system . 52. An auction participant within a predetermined time limit,
In an auction method based on the submission of bids with stakes, the next step is to indicate to the auctioneer the bids of the participants, at least through the interface means, and to detect the bids offered by all the participants by the auctioneer bid detection means Using a real or simulated clock that is with the auctioneer, indicates the start and end times of the auction, and records the auction execution time as well as the time of bid detection by the auctioneer bid detection means; and Determining auction results by an auctioneer determining means, wherein the auction results are represented as a function of auction time. 53. Checking whether a predetermined time after the last bid without any new incoming bid has been detected, or a time varying according to predetermined rules, has elapsed; If no new incoming bid has been detected since the last bid, the participant who placed the last bid found shall be identified as the winner of the auction, otherwise not throughout the auction. 53. The auction method of claim 52, further comprising: identifying a participant who has submitted the last bid before the end time of the auction as a successful bidder.