MXPA00005053A - A system and method for implementing an auction on a computer network - Google Patents

Abstract

The invention is a computerized auction system which includes auction means for processing bids communicated from participants of an auction, communicating receipts of the bids and status details of the auction to the participants and determining a winner of te participants based on the bids received and communicating the winner to the participants.

Description

SYSTEM AND METHOD FOR IMPLEMENTING AN AUCTION IN A COMPUTER NETWORK FIELD OF THE INVENTION The present invention relates to auction systems, and more particularly, to systems and methods for implementing an auction system in a network, for example, a computer network or a television network or by means of an operating mechanism autonomous or automatic ("aut oma t on").

BACKGROUND OF THE INVENTION The disclosures of the following documents are incorporated herein by reference: U.S. Patent No. 5,282,633, issued February 1, 1994 to Boylan and his associates; Number 5,083,271, granted on January 21st to Thatcher and her collaborators; Number 5,630,757, granted on May 20, 1997 to Gagin and his collaborators; Number 4,927,156, granted on May 22, 1990 to Breslow and his collaborators; Number 5,009,429, granted on April 23, 1991 to Auxier; Number 4,637,614, granted on October 18, 1985 to REF .: 120377 Gibbo and his "Contributors" Number 4,261,575, granted on April 14, 1981 to Corely and his collaborators, Number 5,559,312, granted on September 24, 1996 to Lucero; Number 4,922,522, granted on May 1, 1990 to Scanion, Number 4,998,199, granted on March 5, 1991 to Tashiro and his collaborators, Number 5,038,022, granted on August 6, 1991 to Lucero, Number 5,159,549, granted on 27 October 1992 to Hallman and his collaborators, Number 5,083,272, granted on January 21, 1992, to Walker and his collaborators, and Number 5,083,271, granted on January 21, 1992 to T atcher and his collaborators. / 31061 registered May 5, 1995 by Catapult Entertainment, Inc .: WO 93/23125 registered May 14, 1993 by Code asters limited; and WO 93/22017 registered April 30, 1993; and the patent application European Number 0 405 776 A2 published on January 2, 1991 SUMMARY OF THE INVENTION In a first aspect, the present invention is a computerized auction system, which includes the following salient features: means of auction to process offers that are communicated from the participants of an auction, which communicate the receipt of the offers and the details of status of the auction to the participants, and which determines a winner of the participants based on the offers received and who communicate the winner to the participants; means for bidders to communicate in a distinctive way to the auction; distinctive means of offering from the respective participants, and processing of the receipt of the offers and the details of the status of the auction communicated from the auction means; network means for providing communication transmission routes between the auction means and the bidder means, information communicated through the network medium between the auction means and the bidder medium that is under at least one of a first transport protocol and a second transport protocol, the first transport protocol, which is more reliable than the second transport protocol with respect to the data representative of the information arriving at one of the means of auctioning or of the bidder means; the second transport protocol, which is faster than the first transport protocol with respect to the elapsed time for the data to be sent to the network medium and received by one of the auction means and the bidder's method, in which the risks associated with the information communicated under the second transport protocol include loss of data during transmission through the network medium, arrival of the data to one of the auction means and the bidder medium in a different order of order temporary in which data were sent from one of the respective bidding means and the means of auction, and duplicates the data that reaches one of the means of auction and the bidder, being the risks an aspect of the auction with respect to the determination of the winner among the participants. With reference, the offers are communicated from the betting medium to the auction medium, under the second transport protocol and the auction means includes the means of auctioneer for the processing of the offers communicated from the offer medium and which communicates the receipt. of the offers and the status of the details of the auction to the offer medium; the auction means communicates with the bidder medium under the second transport protocol. The means of auction, preferably also includes the administrative means to process the accounts of the participants and process the information related to the 'suba'st'a, in addition to the information communicated from the means of auctioneer and the bidding medium; and the auction means, preferably including a means of auction support to drive the auction means to begin the auction; the auction support means communicates with the administrative means in a secure communication channel on a transmission route that is one of the outside of the network medium and through the network medium. In a preferred implementation of the auction system, the network medium includes at least one of a telephone network, a public mail network, a telefax network, a local area network, and the internet network, The first transport protocol includes a Transport Control Protocol / Internet Protocol (Transport Con trol / In ternet Protocol [TCP / IP]), and the second transport protocol includes a User Datagram Protocol (UDP). In a preferred implementation of the auction system, the bidder means communicates with the auctioneer means under the auction protocols placed by layers on top of the first and second protocols, and these auction protocols may comprise an auction administration and ticketing protocols. offers. Furthermore, the bidding protocols can preferably include parameters that include a value for each of the offers, counting the messages received by the auctioneer from the bidder medium for each of the participants, notions of the time of the auction for each of the bidder's means, identification of the winner of the participants, the time in which the auction has begun, the time in which the auction has ended and one of the current offers becomes the final offer, the number of offers that each participant has left, how long one of the offers to win in the auction must last, and the number of participants. In a second aspect, the present invention relates to an auction system server for a computer network, which includes a means for processing the offers communicated from the participants of an auction through a computer network, a means to communicate information through a computer network to the participants, in response to the offers communicated from the participants, a means to communicate the winner to the participants, through the computer network, r an "environment for a first protocol transport under which the means to communicate the information and the winner is carried out, and a means for a second transport protocol, under which the offers are communicated through the computer network from the participants, the communications under the first transport protocol, which is more reliable than under the second transport protocol with respect to the communications arriving at their destination, the communications under the second transport protocol, which are faster than under the first transport protocol in relation to the time from which the transmission of the communications was made initially for the arrival of the communications to the determined destination, where the risks associated with the communications under the second transport protocol include the loss of the offers during transmission through the computer network, the arrival of offers from different parties cipantes that are in a different order of the temporal order from which the respective bids of the participants were sent, and duplicates at least one of the bids that arrive at a certain destination, the risks being an aspect of the auction in relation to to the means to "" "determine the winner among the participants. The aforementioned auction system server for computer network, preferably comprises an administrative means for processing the accounts of the participants, and an administrative means comprises, in addition to the processing of the content in a form of World Network pages (" Worl d Wi Web pages ") communicated to and from the bidder. Preferably, the first transport protocol comprises a Transport Control Protocol / Internet Protocol (Transport Control / Internet [TCP / IP]), and the second transport protocol includes a User Datagram Protocol (UDP). A third aspect of the present invention relates to a method for implementing an auction system in a communication network, which method comprises: communicating the offers by means of a computer equipment of entry of the respective participants of an auction through from a network to the auction computer equipment; process the offers received through the auction computer equipment; - 'provide receptions of the offers to the incoming computer equipment, by means of the auction computer equipment through the network; determine a winner from among the participants, by means of the auction computer equipment, based on the offers received from the input computer equipment; and communicating the winner to the participants, by means of the auction computer equipment to the entry computer equipment; provide the first and second transport protocols, under which the communications of the auction computer equipment and the input computer equipment are carried out, the first transport protocol being more reliable than the second transport protocol with respect to the communications arriving at a certain destination, the second transport protocol being faster than the first transport protocol with respect to the time elapsed for communications to be sent through the network and received by means of at least one of the communications equipment. computer input and auction computer equipment, in which the risks associated with communications under the second transport protocol, includes the loss of "communications in the network, the arrival of communications to one of the equipment of auction computer and input computer equipment in a different order from the temporal order in which the computer Communications were sent from one of the respective entry computer equipment and auction computer equipment, and duplicates the communications arriving at one of the auction computer equipment and input computer equipment., the risks being an aspect of the auction in relation to the determination of the winner among the participants. Preferably, the method, according to the third aspect of the invention, comprises the processing of the accounts of the participants and the storage of the results of the auction. The network may comprise a public mail network, a telephone network, a telefax network, a radio network, a television network or a computer network. The network used can comprise the network of Internet, the first transport protocol comprises, then, a Transport Control Protocol / Internet Protocol (Transport Con trol / In ternet Protocol [TCP / IP]), and the second transport protocol can comprise a User Datagram Protocol ( UDP).

Preferably, the method, according to the third aspect of the invention, includes carrying out communications related to the offers between the auction computer equipment and the input computer equipment, under auction protocols placed in layers above the first and second transport protocols. The auction protocols can include the administration of the protocols of the offer action. Preferably, the protocols of the offer action include parameters that include a value for each of the offers, counting of the messages received by the auctioneer from the means of offering for each one of the participants, notions of the time of the auction by means of each of the means of supply, identification of the winner among the participants, the time in which the auction began, the time in which the auction has ended, and one of the current offers becomes the final offer , the number of offers communicated to the auction medium at any time, the number of offers that each participant has left, how long one of the offers to win in the auction must survive, and the number of participants.

In the fourth aspect, the present invention relates to a method for implementing an auction on a computer network server, which method comprises: processing the communicated offers of the participants of an auction through a computer network, the communication of the information to the participants, through the computer network in response to the communicated offers of the participants, the determination of a winner among the participants based on the offers received through the computer network, the communication from the winner to the participants through the computer network, the communication through the computer network, under one of the first transport protocol or the second transport protocol, the arrival of the communications to a certain destination, which is more reliable, but slower under the first transport protocol, than under the second transport protocol, the risk of losing c ommunication, delay and duplication under the second transport protocol, which is an aspect of the auction with respect to the determination of the winner among the participants.

* "In" a fifth aspect, the present invention provides an auction system based on the offers with firm support (s take-upported bi ds) of the participants, within pre-established time limits, the system possibly comprises a communication network to carry out the communication between the auctioneer and the participants, the auction system comprising: - a means of interconnection adapted for the presentation of the offers from the participants, - a detector means to detect the offers presented from each participant, - a real or simulated clock located with the auctioneer to mark the start and end times for an auction, record of the action time of the auction, as well as the time points for the detection of the offer in the detection means, and - a means of deciding on the outcome of the auction, the result of the auction being a function of the time points of the auction. ubasta Preferably, the decision means is adapted to effect the test of whether a predetermined period of time or a variable period of time, according to the predetermined rules, has passed after the last detected offer without detection of a new offer that arrives, and if this is the case, identify the participant with the last offer detected as a winner of the auction; and if this is not the case, during the total duration of the auction, identify the participant who submitted the last 'offer before the end time of the auction, as the winner. The means of interconnection may be computer terminals connected to a real-time data transmission communication network, possibly via a modem, and the auctioneer, then connected to the same network by means of a computer terminal in a manner Similary. In addition, the auctioneer's clock, the means of detection and the means of decision can then be included in an auctioneer computer adapted to conduct an auction according to the programmed auction algorithms. The auctioneer computer algorithms are adapted, preferably to conduct offers submitted in real time from the participants during the course of an auction. In a specific implementation, the computer can still be adapted to correct a possible transmission delay from the computers terminals of the participants. One of the auctioneer computer algorithms can be an algorithm to effect the variation of the length of the time period until the "hammer down", as a function of the elapsed auction time, or as a function of the average of presentation of current offers of the total of the participants. In order to present to each participant the progress of the auction that is being carried out and the activity, the computer terminals of the participants and also the communication network can be adapted for the real time information from the auctioneer's computer. In a special implementation, the auctioneer computer algorithms can be adapted to conduct offers presented in a group from each participant within a fixed time point, such that when this point of time has passed, the computer can simulate immediately the total course of the auction. The total number of offers during the auction may be predetermined, and the auctioneer computer algorithms are then adapted to conduct offers submitted from each participant at the same time as the participant makes the entry for the auction / payment of the offers. Alternatively, if a limit is not established for the total number of offers during the auction, the auctioneer computer algorithms will be adapted to drive: a) entry / payment of auction offers from each respective participant within a point of predetermined time, b) thereafter, calculating the total auction time, that is, the end of time from the beginning to the end, c) the establishment of a time limit for the presentation of grouped offer times, from each respective participant, and d) then upon receipt of the offers from the participants and the expiration of the time limit, the simulation of the total course of the auction. The auctioneer computer, the computer terminals of the participants and the communication network can be additionally adapted for the transmission of information about the simulated auction course to each respective participant, possibly in the form of a presentation on the screen of ' l; course of the auction on a real or transformed time scale. In a further implementation, the auctioneer computer may also be adapted to transmit, according to a special programming, lateral information to the participants' computer terminals: a) lateral information that is controlled during real time or the progress of the auction simulated by means of the auctioneer's clock and possibly, by the development of the auction that is being carried out, in order to start the presentation of the image / sound of a short film of the type related to auctions, entertainment or distraction, followed by or "behind" the information of the auction, with the purpose of increasing the attraction to the auction, and b) lateral information that comprises, during the phases of income / payment / pre-offer, animations that contain entertainment or information related to auctions, or possibly advertising. In an alternative implementation of the auction system of the fifth aspect, the auctioneer's computer may comprise a memory for storing a total auction course, such that a participant may have data concerning the course of the auction presented at its auction terminal. computer automatically or upon request after the end of an auction. In an implementation of the fifth aspect of the invention, the implementation of which is directed to an auction carried out by means of a mechanism of autonomous or automatic (a? T oma t on) operation, at least one participant is a genuine participant and a plurality of participants is a number of simulated participants, the other system comprises a random auctioneer generating means that controls the amount of and bid times for the simulated participants, according to predetermined random generator algorithms, the algorithms that contain parameters that can be adjusted so to tune the probability of winning the auction in a range that is compatible with the national law. In a preferred implementation of the auction system of the fifth aspect, it is possible to divide the communication network into two parts: - part of the communication network can be any one of a public switching telephone network, a cellular network, a computer network , or a reverse television channel network, - '' - "the means of interconnection can be any of telephones, cellular telephones, telefax units, computer terminals, and television sets having capabilities in two modes, - the auctioneer can be broadcasting any radio program, television program and even a TV program text via another part of the communication network, whose other part is constituted by any of a public radio channel, a television channel, and a closed circuit network, in which, the actual time information of the TV / radio program text is transmitted in relation to the progress of the auction. n completely different from the auction system according to the fifth aspect of the invention, the means of interconnection are coupons to be completed by each participant and sent to the auctioneer, a coupon that contains information about the time points desired by the participant in issue, within a pre-established time frame, and the amount of offers set according to the rules and according to the backup, the detector means is a coupon reader unit, the decision means is a preprogrammed computer connected to the reader unit of coupon and the clock is "u? i simulated clock, according to which the offers of the participants are ordered chronologically, the communication network which is a public mail network, a telephone network, a fax network , or a computer network. In a sixth aspect of the invention a method is provided for an auction based on the presentation of offers with firm support (s take -support ed bi ds) of the participants, within pre-established time limits, the auction comprising the steps of : the presentation to an auctioneer, offers from the participants through at least means of interconnection, the detection through the detector means of 'auctioneer' presented from any participant, use of a real or simulated clock located with the auctioneer for mark the start and end times of the auction, and to record the time of the auction that is being carried out, as well as the time points for the detection of the offers through the detector means of auctioneer, and the "decision about the outcome of an auction, through the means of the auctioneer's decision, the result being a function of the time points of the offer." Preferably, the auction method also comprises the test whether a predetermined period of time has elapsed, or a variable period of time, according to the predetermined rules, after the last offer detected without the detection of a new offer that arrives, and if this is the case, to identify the participant with the last bid detected as a winner of the auction, and if this is not the case, during the total duration of the auction, identify the participant who submitted the last bid before the end time of the auction, as the winner.

BRIEF DESCRIPTION OF THE DRAWINGS In the following, a more detailed description of the invention is given, which also refers to the examples of the implementation illustrated in the appended claims, where, FIG. 1 shows schematically, the basic elements of a system of computerized auction, according to a first aspect of the invention, figure 2 shows the characteristics of the platform of the physical elements comprising the installation (hardware) and the programming elements and auxiliary services (soft ware) of the servers (servers) of the network that constitutes an essential element of the computerized auction system, according to the first four aspects of the invention, figure 3 shows the characteristics of the platform of the physical elements comprising the installation (hardware) and the programming elements and auxiliary services (s oft ware) of the clients, which constitutes an essential element of the system of computerized auction, according to the first four aspects of the invention, figure 4 shows a top view of the auction system, according to the first aspect of the invention, figure 5 shows a flow diagram that illuminates some necessary steps in a method, according to the invention, ~ 'Fig. 6 is a graphical representation of communication showing the connections between the auctioneer's game machine, Fig. 7 is another graphical communication representation that illuminates the connections between the servers of the auctioneer. auctioneer and the nearest parts of the communications network, Figure 8 illustrates what happens in a real-time version in an "American Auction", Figure 9 illustrates what happens in a version of an "instant" in a " American Auction ", figure 10 shows a schematic way all possible communication network connections between the objects that participate in an auction, according to the i nvention, and Figure 11 shows an example of a visual representation of an offer board for auction participation in an auction of the sealed offer type.

DETAILED DESCRIPTION OF THE INVENTION Figure 1 is a simple illustration of the salient features of the implementation of a computer-based and network-based auction of the invention, in the implementation of which, the auctioneer uses at least two network servers, as shown on the left-hand side of the drawing, of which, a server is principally, an administrative server for processing the accounts of the participants and the related information, while the other server processes the offers via the network from the participants, as well as the communications to the participants in relation to the details of the auction that is being carried out. The figure also shows examples of the personal computers of the participants and the general communication network. Figure 2 refers to the examples of the platforms of the physical elements that comprise the installation (hardware) and of the programming elements and auxiliary services (soft ware) of two necessary servers (servers) of the network. The drawing is based on the text and is self explanatory, and the text of it is incorporated into the present. Figure 3 refers to the examples of the platforms of the physical elements that comprise the installation (hardware) and of the programming elements and auxiliary services (soft ware) for the personal computers of the participants and the drawing is "based on the text and is self explanatory The text is incorporated into the present. * The original concept of auction, being at first an invention that depends on a network, can easily be adapted to cover a much wider segment of the market, the adaptation results as follows: machines of the type "game for children" ("game-boy") - distributed by way of simulation / CDs - automatic gaming machines third party company products, advertising tools / auctions. The inventor considers that this will enhance, at low cost, the value of the invention. The basic underlying concept of "American Auction" ("Ameri can Aucti on") is a concept in which traditional skills are important. Participation will also enhance the strategic (and analytical) skills over a period of execution, improving the overall strategic skills of the participants in their normal work / life situation, thus having greater competitive and educational elements. Last but not least, participation is en tre t enimi by way of the excitement of a real auction, and of the various support issues, such as training, education and entertainment. These are the three most important attractive / salable features that are offered by special auction concept, and should be present in all versions of the invention, because the focus has been on these salient features, while developing the concept of Auction, we consider that these are present as an integrated part of the concept, while, nevertheless, it is important to "tailor" the products / themes and the real medium, apart from the segmentation according to the size In doing so, the auction organizer will be able to cover a vast market, encompassing both high and low "s ta t us" markets, which will compete in the same way with traditional machines. more traditional, "kid games" (game boy) pure entertainment games (based on PC and / or internet), etc. It has also been clear to the inventor that the Auction may very well be an excellent tool "for computer / Internet related companies (as well as those that are not related) in publishing and selling their products through sales licenses and the management of auctions for these companies in which the products are the start of the auction, such auctions can be distributed via CD (through magazines or otherwise), or through the way of looking through a Curiosity network or a local page of a company It is perceived that this idea has a greater power because it is a new concept of market research / advertising in which a product can be prominently displayed to an alternative audience for a long period The concept can be used in a number of spun-off products or spin-offs, highlighting the characteristics of the strategic, educational and / or entertainment policies and variants thereof. 1. Machine type "palm-hel d" of "games of children" ("Game boy"), in which the competition is simulated by the selected number of participants (competence), number of competent / own offers and a varied number of offers per participant / groups of participants. This flexibility will give different "J of difficulty" degrees in the same way as ordinary "child's play" machines, but with different characteristics through themes, strategy and entertainment value. The putting of the game (game pot) in the form of points. Entertainment issues, however, artistically simpler given their limited capacity. 2. Auctions on CD, or simulations distributed over the Internet (with the same characteristics as the "children's game" version) ("Game boy"), but with a more sophisticated animation and choice to be distributed (for CDs) via PC, Magazines / Mail, etc., and to be executed through the PC's own path. This product can be excellent as an enhancement to the animation of the original Auction concept itself, as well as a product that is kept only for entertainment as well as for entertainment for the real Coin Aucti ons. These distributed CD / Internet simulation auctions are also an excellent means of advertising (see above). 3. Automatic gaming machines / competition simulation.

- "'The" same concept as in points 1 and 2 above, but with a winning entry. Such a concept of autonomous auction (a u t oma t on) would be covered by the Legislation of Games in many countries. The setting would be dependent on the degree of difficulty chosen. This product would compete directly with the market for ordinary gaming machines, and the license to current operators should be considered. 4. The auctions organized for the purpose of advertising products, in which the object of auction / placement is the advertising of the product / products of the company. The distribution is made through both channels: CD and Internet.

First Preferred Invention of the Invention A system to conduct an "Auction American "through the Internet The American Auction resembles an ordinary auction, in which players make offers, and if an offer is not challenged for any period of time, the last bidder wins, however, in this" auction "all the offers are of the same "size", the players pay for each offer they make, and the player who makes the last offer is the winner. This is generally referred to in Figures 1- 8. The auctioneer uses, or preferably is a program that handles offers that arrive from the authorized bidders. The program works on a machine with an Internet connection. Bidders must use machines with access to the same internet network in which the auctioneer is connected. The machines must be equipped with a device to watch WW (browser), which can lower the load and execute "Ja va Appl e ts". All participants in an auction communicate with the same (only) auctioneer using the special "auction protocols" placed in layers above the standard Internet Protocols. Figure 4 is a top view of an implementation of the computerized auction system of the invention. The First Level parameters are the auction rules, auction protocols, operating system capacity / optimizations, auction operations and the issues concerning security.

- "'In a next level below the level of performance / optimizations, one aspect is to avoid data conversions, and another aspect is the reduction of message traffic. Under the topic concerning security, there are aspects related to initialization, supply, overload and distribution of results.

The Rules (see Figure 5) 1.1 Preliminaries There are N players each player must buy at least minimum offers, before the auction begins there is usually no maximum limit about the number of offers a player can buy a player can not buy more offers a time the auction has begun. 1. 2 Start Players must decide if they want to play before the auction starts. (Otherwise, players can watch the auction, and then join without risk and with one more chance to win). It would be possible to re-join the auction after the auction has started (the clients' machines will explode). During the demonstrations they will be will allow players to register at any time. 1. 3 The game Players are notified of what At the moment an offer is made at any time when an offer is made, a clock starts to run if it passes. time without further offers, the player who made the last offer is the winner there is a limit cap (tax) about the duration of an auction, - '' '"" probably between an hour or two hours elapsed time (timeout ) decreases as the auction lasts There is a problem of lack of definition at the beginning of the auction, when nobody has made any offer, and there is no winner. It is possible to set the initial time (timeou t) for the total duration of the auction, and reset (reset) the same to a "normal value" when the first real offer arrives. This works well for demonstration purposes (demo), but, with probability it is not suitable for a real auction. Another solution is to set the initial time (timeou t) in the normal way, and in case no one has made any offer during the first seconds of the time to elapse (timeou t), the auction organizer is the winner. A third solution is to have a "local player" who gives a single offer at some time from the beginning of the auction and remains passive thereafter. The local player wins on behalf of the auction organizer. The auction needs to stop at some point. Assuming there are 3600 players, each of which with 10 offers available. With a "timeout" of 10 seconds, in the worst case, the auction would last 100 hours, which would be clearly unacceptable In one implementation, the timeout is linearly depleted as that the auction lasts, however, the timeout can not be allowed to approach zero, such that the time of round trip is greater than the time to pass. A time that is less than the timeout must be set or a solution would be to publish a time limit for each auction If the auction reaches the time limit without having established a winner, the X offer that arrives after the time limit becomes the winning bid 1. 4 Payments Unused bids exceeding the minimum are returned to the players the accumulated fines that each player must pay for at least the minimum bids the auction organizer takes a cut (for example, 20%) of the total income, the rest (the "th e pot") is paid to the participants the players who have not made any offer do not get anything the winner gets a premium fraction ("pri ze"), (for example, 80% of the put) the winner obtains all offers as a refund (where possible) while there is money remaining; players who have made fewer offers get a refund of their offers made (not their offers with fines) any surplus (rounds with errors, etc.) go to the organizer. 2. Auction Protocols The protocol can, for example, use ASCII text encoding. Each message consists of a number of fields separated by blanks. The first 'field r is a single character "tag" which identifies the type of message. 2. 1 Auction Administration It is convenient to use a reliable connection for administrative commands. Login and Qui t. With reference to Figure 6, when a participant wishes to send an administrative command (Login or Qui t.), He (the client) must follow the following steps: 1. Open a TCP connection for Substation / Game machine server (using the same port number as the UDP connection for offers uses). 2. format and write the command to the connection 3. read the response (or possibly "end of the file") 4. close the connection. In the lower part of Figure 6, two sequential accesses of storage medium are shown, that is, one that contains the data in relation to the participants (players) and one to store the records, both connected to the administrative network server.

"" It is "assumed that the administrative system distributes a client code to the participants, along with a" name "and eventually, with the authentication of the information, encryption keys, etc. At the beginning of the auction, the participant must register on a server with a Login message The server (auctioneer will respond with an Acceptance message or an Error message Login = L name of port Accept = the winner A now begins the limit of offers made offers left Time to spend seri e qui in Error = E string name a string alpha numeric port the UDP port that the client wants to use winner the current winner identification now the auctioneer's idea of the current time to start when the auction started (if it starts now> the auction has not yet started) time limit the notion of time of the auctioneer when the current offer becomes final (if the time limit > now the tion is completed) series the serial number of the message of which this is a response offers made how many offers have been made so far (total) offers left amount of offers that the player has left that numerical identification that the player must use in remaining communications With the server, how long must the bet spend to win? When the participant detects that the auction has finished, he must request the results by sending a QUIT message. The server will respond with either a Payment message, a Wait message (if the auction has not yet finished), or a message from Error . Qui t = Q qui in Payment = P what in result offer made offer paid Error = chain E who (who) 'numerical identification result (result t) net amount (or loss if negative) offers made (bi dsmade) amount of offers seen by the server paid offers (bi spai d) amount of offers that the player must pay 2. 2 Bidding Protocol It would be preferable to have a reliable real time communication channel between the auctioneer and the participant from the beginning to the end of the auction, but internet protocols can not provide this. Instead, it is preferable to use UDP as the transport protocol for the offers. This means that the messages run the risk of being lost, they can get out of order, and they can be duplicated. Message delays and message loss should be considered as part of the auction, and an aspect of the auction that participants should be alert to.

The "time of measurement by the auctioneer in seconds since the start of the auction." The notion of time of the auctioneer is the only one that counts.The participants can announce that they are still alive and that they can make offers Bid (Bid) = B series of bid who now (bid serial who now) offer (bid) takes the value of 0 ("I am here) or 1 (" I want to make an offer) series (serial) each participant keeps an account of how many messages have sent , the first message has the series 0 who (who) each participant gets a unique identification (numerical) at the beginning of the auction now (now) the notion of time of the participant auction (not used by the auctioneers up to the present) The client's program will probably send empty offers in a "slightly random" manner, at regular intervals, perhaps something like an average of two messages per minute.The auctioneer sends a message of Received for each message that the same rec ibe of a player.

The auctioneer broadcasts a Status message every "time" that he receives a new offer (and possibly at any other time): Received (Receipt) = R the winner starts now time limit series of offers made offers left who when (winner start now deadline bidsmade bidsleft serial who when) Status (Status) = S winner starts now time limit offers made offers left time elapsed maximum (winner start now deadline bids time tiemeout max) winner identification of the current winner now the notion of the auctioneer of the current time beginning when the auction started (if it starts> now the auction has not started yet) time limit of the auction time when the current offer becomes final (if the time limit > now the action is finished) series the serial number of the message of which this is a response offers 'made' "how many offers have been made so far (tot a) offers left quantity of offers that the player has left who numerical identification of the participant time how long must survive the bets bet to win max number of bidders that (potentially) participate (this, with probability will be the number of participants) assets ", and perhaps, only participants with offers left are included). For each participant, the auctioneer must keep a record of the serial number last seen. When the auctioneer receives an offer (or a "I am here" message), he must verify the serial number of the new message with the serial number saved. • If the new serial number is greater than the saved number, it is accepted, analyzed and answered If the serial number is less than or equal to the saved number, it has arrived out of order (or it may have been "'" "duplicate." The message is ignored (and is not answered) The client is likely to compute the calculation of second round time that is taking place, and it is probably a good idea for the client to synchronize their notion of time with the auctioneer The count of the auctioneer of the number of offers made by a participant is the one that counts The client is likely to keep a record of the last messages for which he has acknowledged and will try to synchronize the local count of the offers The program of the client is likely to not prohibit the participants from sending more offers that the participants are supposed to make. 3. Capacity Each participating bidder must obtain notification of new offers "immediately" when a new offer is accepted from a legitimate bidder. Such notifications ("status messages") are messages in ASCII text, they are small (less than 100 characters), and the content is not secret.

"'In it" "time the auctioneer gets a new offer until it starts broadcasting the status messages is insignificant compared to the time it takes to effect the broadcast." A machine running the auctioneer's program should stop the capacity to send the same (small) message to different UDP addresses N in the course of S seconds, in which, N is the number of participating bidders and S is an acceptable "immediately" approximation. The status message should be sent to one bidder at a time, so that the delay (of the auctioneer) will be 0 for the first bidder and S seconds for the last bidder. Bidders will also experience the delay of the network. It is difficult to predict how much delay will be acceptable to bidders. It could be considered that a total delay of 1 second is more than sufficient, while delays of 4 seconds would be unacceptable. Tests have been carried out using the "Sun Sparcstation 20 running Solaris 2.5." Machines. It seems that they can send anywhere between 1000 and 2000 UDP messages per second.

Operation and Optimizations 4. 1 Avoid Data Conversions Messages and records are textual, all numbers are transmitted in decimals. This is good for purposes of debugging or debugging the program (debugging), but the server will use a considerable amount of time between the binary data and the textual format. Either the binary data or the textual format for special purpose routines could improve the speed. 4. 2 Reduction of Message Traffic Customers should send few "I am here" messages. Clients, with probability, will receive enough State messages to be reasonably updated. Sending State messages to all customers is the biggest bottleneck. The stereophonic broadcast system that uses two stations "mul ti ca s t JP") will likely remove this bottleneck, but unfortunately this is not always available. You should try to avoid "unusable" status messages, for example, by trying to detect if "a batch of bids reaches more or less the same time, and send a status message only when the last one has been processed. If the load is very high and there is a batch of offers that are arriving, you can calmly "drop" all the offers, but the last (of the players) will win with this.If the load is high, try to avoid sending of Receipts for non-winning or empty offers The server could be allowed to send "unsolicited" receipts if it has periods without activity.

. Operating an Auction A real auction must be managed using (at least) two network servers, see figures 1, 2 and 7. Figure 7 shows an example of connections between the nearest central Route Selector (aRouter) in the network of auction servers. An administration server has a two-way connection to the network, which operates under a first transport protocol that is reliable, however, not necessarily very fast. The server is able to present a WWW menu that leads to a demonstration (demo), a registration with possibility for a participant, other types of participation, and also includes a particular credit check. The management server provides the names of users, keywords, etc., for an auction server that has another type of connection to the network, for example, a connection that is operating under a faster transport protocol, but less trustworthy. This fast connection takes care of the current real time of the bidding process in which the messages (offers) must be passed quickly to the auctioneer, as well as the receipts to the participants. A third administration server has been included in the same way in the drawing, whose server takes charge of the messages that are common to all participants, and can operate under the aforementioned first transport protocol. The main management server manages accounts, auction information and network pages, and should not run on the same machine as the auctioneer. A small network server must be run on the same machine as that of the auctioneer. This server communicates with the main server a secure channel, and has the following tasks (see figure 2): upon request, it sends the "Ja va" codes to the legitimate • participants of the auction (bidders) the auction program begins (the auctioneer) at the correct time with the correct parameters saves the result of an auction (records and payment matrix) The auctioneer is preferably a normal Unix program and can be started from the command line: Options Auction # The options are: string 1 (1 s tring) set the record prefix to the string. As the special case if the registration prefix is not set, all records go to standard production. file "b (b fil e) name of legal bidders, no file implies demo mode This file is currently an ASCII text file, which contains a line for each legal bidder.Each line consists of at least two fields, separated by a blank space The first field is the name of the bidder The second field is the maximum number of offers that are allowed to be done Additional fields are ignored in the ordinary way, but they are expected to contain security information ( keys, password) uerto p (p port) the port number to use The same port number is used for UDP and for TCP The current fault is 6010, which is a sufficiently random choice. - ti me is (s time) when the auction begins. Currently, two formats are accepted: + n starts in n seconds, or h. m in point. The current fault is +/1 (after 1 second). - minutes d- (d minutes) how long the auction lasts. The current fault is 20 minutes. - seconds t (t seconds) initial elapsed time (failure is 20 seconds) - maximum m (m max) the number of maximum bid faults per bidder when the demos are being carried out (8 faults) - D (demo mode) Demo mode, allows anyone to register (implies if it is not in the option b) The auctioneer prints a list of authorized bidders before the auction begins (a requirement for accounting and auditing reasons).

The first line identifies the auction, the second is a comment, and the following lines are each for "" "each" "" bidder.Each line contains a numerical identification, the name of the bidder, and the number of offers that same has available.

Example / auction (0.9) 1997/11/17/10. 19.36 = 000879760176 beaver # identi fication who (i d who) offers 000000. 0 000001 Elgil 8 000002 Tom 000003 Eirik 000004 Brunjulv During the auction, the auctioneer prints the interesting events for a file record. Each line begins with a "time stamp", which is the auctioneer's current time (in seconds from some time reference), followed by a "serial number" within each second. The lines of the record are either Comment lines, Login lines, Quit lines, Bid lines or State lines, State lines are printed at all times when a message is broadcast.

Comment '(Cómment) = print size # comments Login = print time I. identification of port name address result Offer = stamp time Offer B serial identification time disposition State = stamp time S winner elapsed time remaining total Quit = stamp time Q. identification id identification numeric winner winner identification current port which port the bidder wishes to use for status messages name real name of the bidder address internet address of the bidder result one of "correct" (ok) "no" or "late" series the serial number of the offer offer 1 (real offer) or 0 (no offer) time notion of time of the bidders (not used by the auctioneer) provision how the offer is treated (empty offer / End of the game / Wait Offer / None remaining / Accepted Remaining time remaining until the time limit (from the time stamp) time of value of the time elapsed total total amount of the offers made by all the bidders so far.

An exempted example: 0879760175.00000/ auction (0.9) 1997/11/17 / 10.49.36 = 000879760176 beaver 000879760177.00000 # I DO NOT BEGIN-RUNNING 0879760177. 00001 S 000000 1199 020 0 0879760179.00000 I 1 43391 Eigil 156.116.2.222.43391ok 08797601797. 00001 B 1 000000 9797660179.854896 accepted 0879760179.00003 S 000001 020 020 1 0879760180.00021 B 000004 000008 0879760180.886145 none subtracted 0879760238. 00001 # printed result 0879760238.00002 S 000002-1 019 32 0879760243.00000 Q 000001 0879760249.00002 # end of auction: 0879760237 After the auction has been completed, the auctioneer prints a results file, which consists of an initial identifi- cation line, then a heading line, followed by a line for each active bidder. Each line contains the bidder's identification number, the name of the bidder, the net result and the number of offers made.

" " Example / auction (0.9) 1997/11/17 / 10.49.36 = 000879760176 cas tor # identification who (id who) results or fertas 000000. 0 0 000001 Elgil -8 8 000002 Tom 17 8 000003 Eirik -8 8 000004 Brunjulv -8 8 6. Source Code # date Friday Nov. 7 13:18:45 MET 1997 # offers wc.com.c reg.c princl. c payment c ug. What is it? c useful c. thu. h 137 481 3152 offers c. 135 '425 2783 commands. c 39 104 765 record c. 164 650 4813 principal c. 113 446 2477 payment c. 108 426 2732 player c. 200 640 4643 running game c 133 439 2954 util. c. 128 541 3287 game h. 1157 • 415227706 main total. s main program for the auctioneer running game. c really runs the auction deals. c handling of the offers that arrive commands. c input command management (tcp) (logon and quit) payment. c implements the current rules for payment at the end of the player auction. c reads / creates / records player data structures. c implements utility registration functions. c several utilities game h. contains common type definitions and client statements c a program that creates one or more clients 7. Security Issues 7. 1 Initialization It is assumed here that the auctioneer program will be started by a minimum network server that operates on the same machine as the auctioneer.

"'' The minimum network server will communicate with the main administrative network server using SSL, and will deliver the code to the authenticated clients (participants) 7. 2 Offer During the auction the participants send offers, and 'the Server sends messages of Receipts and State messages. The loss of messages is part of the game. Cheaters may try to listen to message traffic that they are not authorized to see, they may try to inject fake messages into the message stream, they may send genuine messages again, or they may enter "false bytes" into the message stream. Authentication and encryption techniques can be used to ensure the integrity of the messages, possibly at a substantial cost in processing time. The simplest approach is to allow the auctioneer to share a secret key with each player. This key is used to encrypt and decrypt Receipt messages, Offers messages and Status messages.

"" 'There seems to be no compulsive reason to keep the content of the messages secret. If this is the case, it is sufficient if the key is used to attach a signature to each message. 7. 3 Overload A possible attack could operate as follows: A participant decides to make an offer. As soon as you get a receipt, activate one or more programs, which try to block other participants from getting their offers through the server. These programs could send as much false data as possible to the auctioneer. A possible counter for this type of attack is for the server to delay * the clock if it receives a quantity of unusable data. 7. 4 Result Distribution The server writes the results and records them in the files, that is, the sequential files, as shown in Figure 6. The administrative routines must ensure that these files are saved as long as necessary, and there is no interference in them. 8 Additional preferable characteristics The Auctioneer shall minimize the amount of status messages sent. The Auctioneer must provide signed (or possibly encrypted) messages. There is a public domain of MD5 C implementations, which can be used as a basis to sign the messages. The Auctioneer must handle the overload in a careful manner. You must specify and implement an appropriate strategy for this. It must be made possible to ensure that the auction ends in a reasonable amount of time. A strategy for a termination in adequate time must be specified and implemented.

ADDITIONAL IMPLEMENTATIONS OF AUCTIONS A) "REAL TIME" -Interactive, see Figure 8 Figure 8 is related to the real-time implementation of the computer network auction system! A clock symbolizes the start time of the auction, prior to the time at which participants must have signed and purchased a predetermined number of offers. The "rolling film" (role l ing fi lm) simulates the time period of the auction in operation, during which any participant may place his successive offers at successive time points to prevent the "auction hammer" from falling. definitive way The rolling film can also symbolize a record of the progress of the auction, said record can be placed again at a later time. An actual auction time is played interactively in "real time", starting at a fixed time and ending when a participant wins. (Exactly like a "normal" auction). Offers are purchased in advance, and are used during the auction at the participant's option. The duration of the auction depends on the number of participants allowed and the offers of the participants. Theoretically, the auction can be endless, therefore, it is important to limit the time of the auction by limiting the offers (participants and / or offers). The maximum possible amount is "" 2500 'offers (say: 5 offers and 500 participants). The auction does not start unless the offer starts. It is unlikely that anyone wants to be the first bidder. Therefore, the auction machine has an offer that is used to start the bidding process (only the first offer). An offer wins as long as no other offer arrives within a set number of seconds. In the beginning the period of time is planned to fix it in 30 seconds. (As visualized by the meter count ("auction hammer going down") presented on the screens of the PCs of the participants.In order to limit the total time of the auction, it is variable (30 seconds to win) can be reduced to 20 seconds and up to 10 seconds, at a certain time within the auction, which also increases the intensity of the auction and the nervousness of the participants, thus, proportionately reducing over the time of the auction.

Particular details about protection / security, how to prevent or counteract disturbances "'The" network auction must be protected against unauthorized activities from the participants, and procedures must be created in the same way in case of damage technical / loss of a significant number of participants. In the case of a technical failure, for example, the loss of contact with a certain number (greater number) of participants, and / or the server is in an "overload" situation, the auction will stop. Then, a number of random offers will be "erased" as legitimate offers, and will be returned to the bidders. In this way, nobody can predict which offer was the last offer, in case of manipulation. After a "cleaning", that is, when access to the line has been restored, the auction begins again. The auctioneer will have online contact with at least a n percentage of participants at all times. When this limit is crossed, the auction is stopped, the contact must be restored and then the auction continues. With reference to the problem of disturbances, a precaution of protection for the auction, and a precaution against manipulation, is a function in which? the "java apppl e t" on the client's PC sends (false) messages as a "line check". For an outsider / manipulator, these verifications are impossible to distinguish from real offers, which complicates a possible manipulation effort. further, the traditional "fire walls" (fire-wal l s) will be implemented for the auction server, and the highest security approved in coding will be implemented. A 56 bit DES algorithm is currently approved for commercial applications from the United States of America. This security code is compared to the codes commonly used, for example, by the Bank of Norway. In order to eliminate a bidder with a certain disturbance strategy, the auction can be stopped in the same way as described above, a number of offers will be canceled in a random manner to eliminate the bidder from the disturbances, and then, the game will be restored.

Optional Features All of the three details below will have entertainment value (perceived as "" they have), for the participants and set the auction above other games: I teractivida Design Strategy game (registration-analysis of individual strategy in comparison with other participants / winners after the end of the auction, or alternatively during the auction).

Integrity The auction has full "real time" interaction, since all the actions of the other participants, and the own actions and the reactions to this, are seen.

Design Pure entertainment features are like background design that visualizes the action of the participants through the way of stories. The story should reflect the action of the participants, that is, in the same way be interactive with the auction-action. Themes can be "item-auction with" the auctioneer, gold coin machine, etc. ", dragons and knights, war game, etc., that is, the issues can be unlimited as long as the theme ( or the action within the story), can easily reflect the action-auction.Another feature is that the participant can choose from a range of background stories, the one chosen by preference, which gives him / her greater excitement .

- Strategy You can choose different strategies to participate in an auction. The (last) point of the auction is to have the offer surviving for 30 seconds (or the duration time as the rules of the specific auction for a winner). Later on we will try to present strategies as they are seen, in fact, by indicating in an individual table the opportunities for the participants to win, as affected by the strategies of other participants: Individual strategy It can be observed from the table presented above, which is important for the chances of winning, that the participant is against "cycloco" to the strategy of the "mainstream". The strategy may have to be different for the different periods * of the auction (start / middle / end), as can be seen, a "no action" strategy in the beginning and an "action" strategy towards the end, so so that you could really plan more than one strategy for each individual action. An individual participant strategy of auction record comparison with participant / winner average will give feedback for the strategy of the next auction. This, we hope, will be perceived as "educational" / "a learning experience", and definitively, as entertainment, even if a winning strategy for an auction may be a loser strategy for the next auction. Finally, the auction record can be used to define: 1. the 2nd and 3rd place (after the winner) 2. the winning strategy 3. the optimal strategy-early auction /.- medium / late 4. total time in the winning position 5. how many rounds of offers have you waited outside ("remained calm") - 6. how many offers given at the same time "" 'A "Limited amount of participants give high chances of winning compared to most other types of games, therefore, providing a high attraction value.

Market segmentation First Segmentation Row: Participants must have access to the PC or other type of interconnection equipment Second row of Segmentation: Cost of the offers (that is, it covers the tributaries and the average segments based on this variable).

Examples Affluent offer US $ 100/1000 (total cost in 5 offers / auction auction U $ S 500/5000) Average offer US $ 1/20 (total cost in 5 offers / auction auction U $ S 5/100) B) SIMULATION 1 Non-interactive, see Figure 9 Figure 9 is similar to Figure 8, but refers to the implementation of the "simulated auction", that is, the auctioneer's computer calculates (the calculator symbolized as a machine in the center) an immediate result when the offers with indicated time points have been received from all the participants. A record is prepared at the same time, symbolized by the short film "shot from film" (on the right, and the record can be brought at any time later by the participant.) This is the auction version for participants who want full freedom in choosing your own moment of participation - without having to wait during the auction process, or an established offer or an auction time.The beauty (from the organizer's point of view) of this auction, is that This is a totally flexible auction with regard to meeting the market demand, sian auction begins as soon as the previous one ends This simulated auction is non-interactive, with a limited number of participants Participants form in / purchase offers and offer individually "up to a flexible start time (when the pre-established number of participants have signed / offered). icipantes is established before participants can sign / participate. As a result of the above, the participant starts immediately after the established number of offers has entered, as a non-interactive / offline auction. The server, based on the allowed number of offers (bidding function per participant / participants), has created a time simulation chain, divided into individual blocks, with enough individual blocks to allow space between offers (unused blocks), that is, to allow any offer in the chain to win - at the beginning - middle - end). This procedure is a total replication / simulation of the "real time" auction, except for the interactive element. That is, the 'participants can not in this auction, react to the other participants during the auction, otherwise, the selection criteria for the winner is exactly the same. When the bids have been made, all bids have been given, the auction machine will immediately declare the time, and will carry out the bid-based auction. In this way, a winner / winners is selected. When this has been done, participants can enter the local page of the organizer and reposition the auction record and the auction display. Each individual participant will be able to see their offers on the screen, and the duration of each offer. Subject to a limited number of offers per player, the entire auction can be viewed over a period of 5 minutes. In relation to the duration of the auction, the present simulation is instantly. However, a participant will use the time it takes to bid. Total individuality when it is done. Because it is dependent on a fixed amount of offers that have been made, the point in time is not known when the present auction is carried out on the auction machine. This auction may be played at any time, but may have a delay in the selection of the winner.

"'Debi or this is simulated, the problem of the first offer does not appear, there will always be a first offer, then the auction begins, an auction wins, as long as there are no other offers that arrive within a set number of seconds. In the beginning, this time is planned in 30 seconds This simulation of seconds between offers is made by placing a number of seconds in each block (position in which the offers are allowed). blocks in a time chain, (the total time of the auction) that offers allowed, there may be an open space / blocks between two offers that represent 30 seconds, and in this way a winner may appear before the auction ends. trick is to calculate the number of blocks in relation to the number of offers, to allow for both a winner at the beginning / middle and end (the last bidder), subject to total bid strategy. question if a participant can manipulate the auction machine before the auction begins. When the simulation / winning time of the auction is calculated, this is done offline, that is, no 'interference / manipulation from external sources is possible.

Optional Features Because this auction implementation is totally non-interactive and out of line with the auction machine, the interactive feature of the other auctions is non-existent, however, this can be provided with extra features to give a semblance of interactivity (see below). One or more of the details presented below should be present in the auction for the effects of attraction and entertainment value: Simulated Interactivity The auction is totally non-interactive in all phases. However, it is possible to create, as previously mentioned, a semblance of interaction, with a theme that appears during an individual game, exactly as described under "Simulation 2", see below.

Design "'The" purely entertainment features are the background design that visualizes the action by way of stories - theme. The story will be simpler than the "real time" investment (during the bidding time), and could not reflect the action interactively on the "big board" graphically, since the bid is made by over a period of (say) 15 minutes. However, it is important to give the impression of interactivity or at least, of action. This can not be done by interacting with other actions of the bidders, however, since this would be of false appearance (there will always be some participants who have not yet placed their bids - thus affecting the strategy of an individual participant afterwards. that individual participants have placed their offers). Therefore, the design theme must interact with other parameters than the present offer action. You can bring this individual record from a previous auction, to guide the current offer, as well as the background story. Another feature is that the participant can choose from a range of background stories, the one that most "liked" him, which gives him / her more excitement, or alternatively, leave the topic of the stories aside to concentrate 100% in the auction process.

Strategy The same as in the implementation of "real time". A limited number of participants give a high chance of winning, compared to most other types of games, consequently providing a high attraction value.

Segmentation of the Market First row 'of Segmentation: access to the PC Second row of Segmentation: Cost of the offers, (that is, it covers the tributaries and the average segments based on this variable), and without time / limited to play an auction of "real time".

"" 'C) "SIMULATION 2 - Non-interactive / perceived (partially) interactive, see Figure 10 Figure 10 represents an implementation that is an intermediate solution in relation to the one shown in Figures 8 and 9. The participants, really they do not get involved in the interactive auction, but, nevertheless, they have a specified period of time, symbolized by the two clocks, during which they place their bids in. The "broken" film roll symbolizes the non-interactive bidding action during The bid period The machine placed on the right hand side symbolizes the calculation instantly of the results of the auction after the expiration of the offer period, and the short film "film roll" on the far right is a registration that can be brought at any time later This type of simulated auction is non-interactive, with a limited number of participants Participants sign / buy offers individually at, until a pre-established start time, but the offer action during a limited time interval (bid time). When the number of offers / participants is known (at the time of commencement), the auction server performs a simulation chain of time, divided into individual blocks (simulating an auction), with enough individual blocks to allow space between offers (that is, it allows any offer in the chain to win, since there may be spaces between each offer, such that any offer can win - either at the beginning / middle, or at the end). Participants are allowed 10/15 minutes to use their offers in the chain - which can be displayed in a multidimensional way to make the offer in a coupon more easily. When the offers have been entered (within the allowed offer period), the instant / instant auction machine will simulate the time (auction) and appear with the winner / winners. The auction will be displayed immediately, when the winner has been "calculated", by way of a meter that shows the offer activity on an axis of time with the individual offers entered. Each individual participant will see their offers on the screen, and how long each offer lasts. Subject to a limited number of offers per participant, the auction in its entirety can be viewed over a period of approximately 5 minutes, regardless of how many participants are participating. The duration of the auction is independent of the number of participants / offers. Fixed time to bid (online, not interactive). The total time of the auction, including the display can be approximately 15/20 minutes. One benefit of this auction implementation is that the participant, not having a "real time" for the participation (or who wants a second auction, after a "real time" game), can enter this auction. Because time is simulated, the problem of the first offer does not appear. There will always be a first offer. Then, the auction begins. An auction wins, as long as there are no other offers that arrive within an established number of seconds. In the beginning, this time is planned in 30 seconds. The simulation of seconds between offers is made by placing a number of seconds in each block (position in which offers are allowed). Because there are more blocks in a time chain (the total time of the auction), than the allowed offers, there may be an open space / blocks between two offers "representing 30 seconds, and in this way, a winner may appear before the auction ends The trick is to calculate the number of blocks in relation to the number of offers, in order to allow for both a winner at the beginning / middle and end (the last bidder), subject to the total bid strategy.

Disruption / unauthorized access-protection Such protection can be an issue if a participant can manipulate the auction machine before the auction begins. When the simulation / winner time of the auction is calculated, this is done offline, that is, no interference / manipulation from external sources is possible.

Optional Characteristics The totality of the three details below will have (should be perceived as having) value of attraction and entertainment for the participants and will establish the auction over other types of games: "•" Interaction Design Auction strategy (registration -analysis of individual strategy compared to other participants / winners after the auction ends - or alternatively, during the auction) Integrity The auction is not interactive in the normal sense (as in the "real time" version). However, this is an alternative auction for those individuals who do not have time for the fully interactive version. Since the auction (bid placement) is played for a predetermined period, and the auction is viewed in an "amended real time", the participants will perceive the auction as if they were participating interactively during the viewing / viewing.

Design The purely entertainment features are the background design that visualizes the action by way of stories - theme. The story will be simpler than the "real time" version (during the bidding time), and will not be able to reflect the action interactively on the "big board" graphically, because the offer is made over a period of (so to speak) 15 minutes. It is important, however, to give the impression of interactivity, or at least, of action. This can not be done through interaction with other actions of the bidders, however, since this would be misleading (there will always be some participants who have not yet placed their bids - thus affecting the strategy of an individual participant after individual participants have placed their offers). As a consequence of the above, the design theme must interact with other parameters than the present offer action. It is possible to bring this individual record from a previous auction, to guide the current offer, as well as the background story. Another feature is that the participant can choose from a range of background stories, whichever is pleasing to him, which gives him / her more excitement, or alternatively, leave the subject of the stories "" aside for Concentrate 100% on the auction process.

Strategy The same as in the implementation of "real time" Win / lay opportunities An unlimited number of participants give a low chance of winning, compared to the "real time" auction, however, on the other hand, the play must be much higher.

Market segmentation First Segmentation row: access to the PC.

Second row of Segmentation: Cost of the offers (that is, it covers the tributaries and the average segments based on this variable), and time / limited to play.

LEVELS OF ACTIVITIES ON THE SCREEN (VISUALIZATION): The visual history on the screen, as visualized by a participant, needs to be created as interactive, with actions interacting at different levels with auction activities. This will be basically four levels that would interact individually as follows, and a fifth "just for fun".

The scene (general theme) The auctioneer The general participant population ("competitors" -anyone except you) Funny "apparitions" (seated) - (randomly distributed from start to end of the auction), just for fun, as well as as an "element of confusion".

FACTS / INFORMATION TO PARTICIPANTS DURING THE AUCTION Particularly, in a real-time computer network auction implementation, but also in simulation implementations, the following information "will be of interest to the participants, and any or all of the features listed below will be transmitted to the personal computers of the participants: Synchronization of the rounds of offers (fixed, random or sequential - it is believed that the random alternative is the most exciting, in which the meter counter (to win) is shifted randomly from 30 seconds to 20 seconds, up to 15 seconds during the auction This will highlight the excitement, and will need a higher concentration from the beginning to the end of the auction The individual life of each offer Traffic (how many offers entered during the time period / sequence Number of offers left (total and individual) Number of offers placed (total and individual) Total number of offers (total or individual) Number of participants Size of the application PARAMETERS * OF REGISTRATION: The registration is intended to be a guide for the participants, informing them of their actions / not actions and in the way that affects your chances of winning.The registry will also inform you about your strategy compared to on the optimal winning strategy, and will provide suggestions for alternative strategies, which will help them in the next auction, therefore, giving them a sense of winning opportunities "no matter that this time they have not won". The auction record will be accessible after the auction has finished. We hope that the auction record also has an independent entertainment value, and can be viewed on the PC screens of the participants. The following elements will be (considered to be) included in the registry: You are the winner Time that lasted all the offers How many rounds remained quiet (position of "wait" at the end of a round / total of rounds accumulated) How many rounds remained quiet (accumulated) How many times the same strategy as others (acting within the same "second", like others, and how many others How many times a different strategy (define "different") Optimal strategy versus your strategy Winner strategy versus your strategy Alternative winner strategy in this auction (good advice for next time) IDEAS FOR THEMES: As examples of alternative topics: Auction with "Einstein" as auctioneer Auction on a Steamboat on the Mississippi (from 1870) Auction at a castle in Scotland "Indiana Jones" - obstacle course - Live / die (Seeking the Sacred Chalice) Traditional auction (with apparitions) Casino environment / high society Direct action auction coupon (like the Lotus), the "no hassle" version for mock auctions, etc. Etc.

APPEARANCES -STT. COM / POP-UPS '. These can be a special feature recognized for the auction organizer (for example Gary Larson in "The Far Side") and can also be used for advertising during the auction. The idea would be to continuously create these appearances. These appearances confuse the participant, as well as provide the auction with added entertainment value. They must be so interesting and funny that they interfere with the participant's concentration, but it makes the auction more fun to participate in. (as compensation for the loss of concentration - and possibly, the loss of the auction, still). The appearance at random of these figures should not be so frequent, and they should appear / disappear in, so to speak, 5/6 seconds. These appearances can both be presented in "real time", and in particular, in the simulated versions of the auction, to make entertainment more "interactive" and interesting.

* Figure 11 shows in a general manner, and similar to Figure 1, the various parts / objects that may be involved in an auction system, according to the invention. Two or more objects can be interconnected in an open or closed communication, which can be analogous or digital. In addition to the participating PCs, and the auctioneer servers, which have been extensively discussed herein before., the following possibilities will be mentioned: video / automatic auctions can be carried out, either with a connection via a network, an auctioneer server, or the complete auction system can be carried out within the automatic device (aut oma) t on), the type of auction, then, which is one with other simulated participants. (the automatic free-stay device can also be made in the form of a small device, for example, that can be held in the palm of the hand) However, an automatic device can, of course, operate as a terminal in a similar manner as a PC One way to conduct an auction, according to the invention, is in connection with a TV show, or radio show. In such a case the normal TV or radio tchannels (public or closed circuit) can be used as a part of the communication network, namely, to present the progress of the current real time of the auction for the participants, who can, for example, use a telephone network (cellular or public switching) as the network part to make offers, that is, sending the messages to the auctioneer. Therefore, the elements of telephone, radio and TV are shown in the drawing, in conjunction with a telefax it is also possible an interconnection with a telephone network. It should also be noted that in a digital television network, a two-way communication is possible, therefore, providing a possibility for TVs with return message, with the help of touching the screens or, for example, the controls remote manuals. Finally, for example, a TV show, there will usually be an audience and people from the audience can also take part as participants in an auction, then, they receive an interconnection unit (radio or wired to the computer). of the auctioneer) to enter an auction session.

"" 'Figure 12 shows an example of a "bidding board" that can be used in connection with an "instant" auction type, see Figure 9, and the board can be presented on a PC or a PC. screen, or for example in an automatic device The placement of the offers, that is, specific marking of the time points, is made in a simpler way by moving the positions of the hour, minute and second in the three scales / dials shown, and the confirmation of when a desirable time point has been set.When all the allowed offers have been placed, the total package of offers is sent to the auctioneer by using the "SEND" button (SEND) a Characteristic that can be included, is an "accumulated value", which shows the sum of all the offers made up to the present, at the moment of entering the offer, to give the participant an idea of the possible winning entry. in relation to this date, the best method known to the applicant to carry out the aforementioned invention, is that which is clear from the present description of the invention.

Claims (53)

1. Having described the invention as above, property is claimed as contained in the following claims: 1. A provision to implement a computerized auction for participants of an auction, based on the offers with firm support of the participants of the auction, within limits of pre-established time, the provision possibly comprises a communication network for carrying out the communication between an auctioneer and the participants, characterized in that it comprises: - computer interconnection means adapted for the presentation of the offers from the participants, - a computer detecting means to detect offers submitted from each participant, - a real or simulated computer clock placed with the auctioneer to mark the start and end times for an auction, recording the execution time or action of the auction, as well as the points of time for the detection of offer in e l means of computer detection, and "-" means of a computer decision to decide on the result of the auction, the result of the auction being a function of the time points of the offer.
2. 2. The arrangement according to claim 1, characterized in that the decision means is adapted to perform the test of whether a predetermined period of time or a variable period of time, according to predetermined rules has passed after the last offer detected without the detection of a new offer that arrives, and if this is the case, identify the participant with the last offer detected as a winner of the auction, and if this is not the case during the total duration of the auction, identify the participant who has presented the last offer before the end time of the auction, as a winner.
3. 3. The arrangement according to claim 1, characterized in that the interconnection means are computer terminals connected to a communication network that transmits real-time data, possibly via a modem, and where the auctioneer is connected to it. network by means of "nail" "computer terminal in a similar way.
4. 4. The arrangement according to claim 3, characterized in that the auctioneer's clock, the detector means and the decision means are comprised in an auctioneer computer adapted to conduct an auction according to the programmed auction algorithms.
5. 5. The arrangement according to claim 4, characterized in that the auctioneer computer algorithms are adapted to drive offers submitted in real time from the participants during the course of the auction, and where the computer is adapted for possible correction due to a delay of transmission from the terminals of the computers of the participants.
6. 6. The arrangement according to claims 2 and 5, characterized in that one of the auctioneer computer algorithms is an algorithm for varying the length of the time period as a function of the elapsed auction time or average bidding of all the participants .
7. 7. The arrangement according to claim 5, characterized in that the participating computer terminals and also the communication network are adapted for the transmission of the real time information of the auctioneer computer, in order to present to each participant the progress and activity of the auction that is taking place.
8. 8. The arrangement according to claim 4, characterized in that the auctioneer computer algorithms are adapted to conduct offers presented in a group from each participant within a fixed time point, such that when this time point has passed, the The computer can immediately simulate the total course of the auction.
9. 9. The arrangement according to claim 8, characterized in that the total amount of offers during the auction is predetermined, being the computer algorithms of "auctioneer adapted to conduct offers presented from each participant the same time, as the participant makes the entry. for the auction / payment of the offers.
10. 10. The arrangement according to claim 8, characterized in that no limit is set for the total number of offers during the auction, the auctioneer computer algorithms being adapted to drive a) auction entry / payment of the offers from each participant respective within a predetermined time point, b) after this, calculate the total auction time, that is, the time span from the beginning to the final time, c) establish a time limit to present bid times grouped, from each respective participant, and d) subsequent to the reception of the offers from the participants and the expiration of the time limit, the simulation of the total course of the auction.
11. 11. The arrangement according to any of claims 8-10, characterized in that the auctioneer computer, participating computer terminals and communication network are adapted to or the transmission of information about the simulated course of the auction for each respective participant, possibly in the form of a screen presentation of the course of the auction on a real or transformed time scale.
12. 12. The arrangement according to claim 7 or claim 11, characterized in that the auctioneer computer is also adapted to transmit, according to the special programming, lateral information to the participants' computer terminals, (a) the lateral information being controlled during the real time or simulated the progress of the auction by the auctioneer's clock and possibly by the development of the auction that is being carried out, to start the presentation of image / sound of a short film of a type that it relates to the auction, entertainment or distraction, followed by, or "behind" the information of the auction, in order to increase the attractiveness of the auction, and (b) the lateral information that comprises, during the phases of income / payment / pre-offer, animations that contain entertainment or information related to the auction or possibly advertising.
13. "*" 13. "The arrangement according to claim 4, characterized in that the auctioneer computer comprises a memory for storing a total course of the auction, in such a way that a participant may have data concerning the course of the auction presented in your computer terminal automatically or a requirement after an auction has ended.
14. 14. The arrangement according to claim 1, characterized in that at least one participant is a genuine participant and a plurality of participants is a number of simulated participants, the system further comprising, a random auctioneer generating means that controls the amount and times of offer for simulated participants according to the predetermined random generator algorithms, the algorithms contain adjustable parameters in order to * tune the probability of winning the auction within a range that is compatible with the national law.
15. 15. The arrangement according to claim 1 or 2, characterized in that "-" starts from the communication network is any one of a public switching telephone network, a cellular network, a computer network and a reverse TV channel network, the means of interconnection can be any of telephones, cell phones, telefax units, computer terminals and TV sets that have communication capabilities in two ways, the auctioneer that broadcasts any of a radio program and a TV program text. via another part of the communication network constituted by any of a public radio channel, a TV channel and a closed circuit network, in which, the real time information of the TV / TV / radio text program is transmitted in relation to the progress of the auction.
16. 16. The arrangement according to claim 1, characterized in that the interconnection means are coupons that are completed by each participant and sent to the auctioneer, a coupon contains information about the offer time points desired by the participant in question, within a pre-established time frame, and with a number of fixed offers according to the rule and in agreement with the backup, the detector means is a coupon reader unit, the decision means is a preprogrammed computer, connected to the reader unit of coupon, and the clock is a simulated clock, according to which the offers of the participants are ordered chronologically, the communication network being a public mail network, a telephone network, a fax network or a computer network .
17. 17. The arrangement according to claim 1, characterized in that it comprises an auction means for the processing of the offers that are communicated from the participants, which communicates the receipts of the offers and the details of the status of the auction to the participants, and determines a winner of the participants based on the offers received and communicate the winner to the participants; a means of bidding to clearly communicate to the clear auction means the offers of the respective participants and process the receipt of the offers and the details of the status of the auction communicated from the auction means; network means for providing communication transmission paths between the auction means and the bidder means, information communicated through the network medium between the auction means and the bidder medium that is under at least one of a first protocol of transport and a second transport protocol, being the first transport protocol more reliable than the second transport protocol with respect to ensuring that the representative data of the information reach one of the means of auction and the means of bidder, being the second transport protocol faster than the first transport protocol with respect to the elapsed time for the data to be sent through the network medium and received by one of the auction means and the bidder medium, where the risks associated with the information communicated under the second transport protocol includes the loss of data during transmission through the network medium, the arrival of the data to one of the means of auction and of the bidder medium in a different order from a temporal order in which the data was sent from one of the respective bidding means and the auction means, and the duplication of the data that arrives at one of the means of auctioning and the means of bidding, the risks being an aspect of the auction with respect to the determination of the winner among the participants.
18. "" 18. The arrangement according to claim 17, characterized in that the offers are communicated from the bidder means to the auction means under the second transport protocol.
19. 19. The arrangement according to claim 17, characterized in that the auction means comprises auctioneer means for processing the offers communicated from the bidder means and communicates the bids of the bids and the details of auction status to the means of auctioning. bidder, the auctioneer who communicates with the bidder under the second transport protocol.
20. 20. The arrangement according to claim 19, characterized in that the auction system comprises administrative means for the processing of the accounts of the participants and the processing of the information related to the auction apart from the information communicated between the auctioneer means and the means of bidder.
21. 21. The arrangement according to claim 20, characterized in that the administrative means further comprise means for the processing "" of the content in a form of Large World Network pages communicated to and from the bidding means.
22. 22. The arrangement according to claim 20, characterized in that the auction means includes an auction support means to drive the auction means to start the auction, the auction support means that communicates with the administrative means in a channel of auction. secure communications on a transmission path that is one outside the network medium and through the network medium.
23. 23. The arrangement according to claim 22, characterized in that the auction support means further comprises means for storing the results of the auction.
24. 24. The arrangement according to claim 22, characterized in that the auctioneer means and the auction support means together comprise a first computer network server coupled to the network medium, and the administrative means comprises a second computer network server. coupled to the network medium.
25. 25. "The arrangement according to claim 17, characterized in that the network means comprises at least one of a telephone network, a public mail network, a telefax network, a local area network and the internet network, the first The transport protocol comprises a Transport Control Protocol / Internet Protocol (TCP / IP), and the second transport protocol comprises a User Datagram Protocol (UDP).
26. 26. The arrangement according to claim 21, characterized in that the network means comprises the Internet network, the first transport protocol comprises a Transport Control Protocol / Internet Protocol (TCP / IP), and the second transport protocol comprises a User Datagram Protocol (UDP).
27. 27. The arrangement according to claim 26, characterized in that the auctioneer means communicates with the bidder means under the TCP / IP, and the auction support means communicates with the administrative means under a secure receptacle layer (SSL) .
28. ~ '28. "The arrangement according to claim 19, characterized in that the bidder means communicates with the auctioneer means under the auction protocols placed in layer above one of the first and second transport protocols.
29. 29. The arrangement according to claim 28, characterized in that the auction protocols comprise the administration of auction and supply protocols.
30. 30. The arrangement according to claim 29, characterized in that the auction administration protocols include parameters comprising names of the participants, identification of the access communication ports to the auctioneer means through the bidder means for the respective participants, identification of the winner of the participants, time of reference for the auction, time when the auction is about to begin, time when the auction is about to end, time when a current of one of the offers becomes a final offer, quantity of the offers accumulated in one of any of the times, amount of offers that one "in" particular of the participants has stopped showing up at the auction, and how long a particular one of the offers must remain higher than the offers to become a winner of the offers.
31. 31. The arrangement according to claim 29, characterized in that the bidding protocols include the parameters comprising a value for each of the offers, the count of the messages received by the auctioneer means from the bidder means for each of the bidders. participants, notions of the time of the auction through each of the bidder means, identification of the winner of the participants, time when the auction begins, time when the auction ends, and a stream of one of the offers becomes a final offer , amount of the offers communicated to the auctioneer in one of any of the times, number of offers of each of the participants has left, how long one of the offers must survive to win in the auction, and quantity of the participants.
32. 32. A server for processing offers of auction participants in a compliance arrangement "with claim 1, characterized in that it comprises: a means to process offers communicated from the participants of an auction through a computer network, a means to communicate information to through the computer network to the participants in response to the offers communicated from the participants, a means to determine a winner of the participants based on the offers received through the computer network, a means to communicate through the network of the computer the winner to the participants, a means for a first transport protocol under which the means to communicate information and the winner is carried out, and half for a second transport protocol under which the offers are communicated through the computer network from the participants, being the communications under the first transport protocol more co nfiable than under the second transport protocol with respect to the communications reaching their destination, with communications under the second transport protocol being faster than under the first "transport protocol" with respect to the initial transmission time of incoming communications of communications to a specific destination, where the risks associated with communications under the second transport protocol include the loss of offers during the transmission through the computer network, with the arrival of the offers of different participants in a order different from a temporary order in which the bids were sent from the respective bids of the participants, and duplicates from at least one of the bids that arrive at a certain destination, with the risks being an aspect of the auction with respect to the means to determine the winner of the participants.
33. 33. The server according to claim 32, characterized in that it also comprises administrative means for the counting processing of the participants.
34. 34. The server according to claim 33, characterized in that the administrative means further comprises a means for processing the content in a form of Large World Network pages communicated to and from the bidder means.
35. "'35." "" The server according to claim 32, characterized in that the first transport protocol comprises a Transport Control Protocol / Internet Protocol (TCP / IP), and the second transport protocol comprises a User Datagram Protocol (UDP). .
36. 36. The server according to claim 32, characterized in that the offers are communicated from the participants under the layer auction protocols above one of the first and second transport protocols.
37. 37. The server according to claim 36, characterized in that the auction protocols comprise the administration of auction and supply protocols.
38. 38. The server according to claim 37, characterized in that the auction administration includes parameters comprising the names of the participants, identification of the access communication ports to the auctioneer means through the bidder means for the respective participants, identification of the winner "give" the participants, reference time for the auction, time when the auction is about to begin, time when the auction is about to end, time when a current of one of the offers becomes a final offer, quantity of the accumulated offers In one of any of the times, quantity of offers of one particular of the participants has stopped presenting in the auction, and how long one in particular of the offers must remain higher of the offers to become a winner of the offers .
39. 39. The server according to claim 32, characterized in that the supply protocols include parameters that comprise a value for each of the offers, counting of the messages received by the auctioneer means from the bidder means for each one of the participants, notions of time of the auction by each one of the means of bidder, identification of the winner of the participants, time when the auction begins, time when the auction ends and a current of one of the offers becomes a final offer, quantity of the offers communicated to the auctioneer in one of any of the times, amount of "sfertas of each of the participants has left, how long one of the offers must survive to win in the auction, and amount of participants.
40. 40. A method for implementing an auction using an arrangement according to claim 1, characterized in that it comprises the steps of: presenting to an auctioneer offers of the participants via at least means of interconnection, detecting by means of detector means of auctioneer tenders presented from any participant, use a real or simulated clock located with the auctioneer to mark the start and end times of the auction, and to record the time of the auction that is being carried out, as well as the time points for the detection of the bid by means of the bidder's bid detector means, and deciding on the outcome of an auction through an auctioneer's decision means, the result of the auction being a function of the time points of the bid.
41. 41. "" "The method according to claim 40, characterized in that it further comprises, testing whether a predetermined period of time, or a variable period of time according to the predetermined rules, has passed after the last detected offer without the detection of a new offer that arrives, and if this is the case, identify the participant with the last offer detected as a winner of the auction, and if this is not the case during the total duration of the auction, identify the participant who submitted the auction. Last offer before the end time of the auction, as a winner.
42. 42. The method according to claim 40, further characterized by the communication of the offers by means of the computer equipment of entry of the respective participants of an auction through a network to an auction computer equipment; the processing received from the offers by means of an auction computer equipment; providing by means of an auction computer equipment through the network, the receipts of the offers to the incoming computer equipment; "determining through the auction computer equipment a winner of the participants based on the offers received from the entry computer equipment, and communicating through the auction computer equipment to an entry computer equipment the winner of the participants, providing first and second transport protocols under which communications between auction computer equipment and computer input equipment are carried out, the first transport protocol being more reliable than the second transport protocol with with respect to the communications arriving at a certain destination, the second transport protocol being faster than the first transport protocol with respect to the time elapsed for the communications that are sent through the network and received by at least one of the communication equipment. computer input and computer auction equipment, where the risks associated with the com Communications under the second transport protocol include the loss of communications in the network, the arrival of communications in one of the auction computer equipment and the computer equipment of entry in a different order from a temporary order in which they were sent. from respective communications of one of the input computer equipment and auction computer equipment, and duplicates of communications arriving at one of the computer's auction equipment and computer input, with the risks being an aspect of the auction with respect to the determination of the winner of the participants.
43. 43. The method according to claim 42, characterized in that it also comprises the processing of the accounts of the participants.
44. 44. The method according to claim 42, characterized in that it also comprises the storage of the results of the auction.
45. 45. The method according to claim 42, characterized in that the network comprises one of a public mail network, a telephone network, a telefax network and a computer network.
46. * "'46." "" The method according to claim 42, characterized in that the network comprises the Internet network, the first transport protocol comprises a Transport Control Protocol / Internet Protocol (TCP / IP), and the second transport protocol comprises a User Datagram Protocol (UDP).
47. 47. The method according to claim 42, further comprising carrying out the communications related to the offers between the auction computer equipment and the computer equipment of entry under the protocols of auction in layer above one of the protocols. of transport first and second.
48. 48. The method according to claim 47, characterized in that the auction protocols comprise the administration of the auction and bidding protocols.
49. 49. The method according to claim 48, characterized in that the auction administration protocols include parameters comprising the names of the participants, identification of the communication ports of access to the auctioneer means through the bidder means for the respective participants, identification of the winner of the participants, time of reference for the auction, time when the auction is about to start, time when the auction is about to end, time when one of the current offers becomes a final offer, quantity of the offers accumulated in Any of the times, amount of the offers that one particular of the participants has failed to present at the auction, and how long a particular one of the offers must remain higher than the offers to become a winner of the offers.
50. 50. The method according to claim 48, characterized in that the offer protocols include parameters that comprise a value for each of the offers, counting of the messages received by the auctioneer means from the bidder means for each one of the participants, notions time of the auction through each of the bidder means, identification of the winner of the participants, time when the auction begins, time- when the auction ends and a stream of one of the Offers becomes a final offer, amount of the offers communicated to the auctioneer in one of any of the times, quantity of offers of each one of the participants has left, how long one of the offers must survive to win in the auction, and quantity of the participants.
51. 51. The method according to claim 40, further characterized by the processing on a computer network server offers communicated from the participants of an auction through a computer network, communication from the server of the information through the network of computer to the participants in response to the offers communicated from the participants, the determination on the server of a winner of the participants based on the offers received through the computer network; the communication from the server through the computer network of the winner of the participants; the communication from the server through the computer network under one of a first transport protocol '"and a second transport protocol, the arrival of the communications to a certain destination, which is more reliable but slower under the first protocol of transport that under the second transport protocol, the risk of communications being lost, being the delay and duplication under the second transport protocol an aspect of the auction with respect to the determination of the winner of the participants.
52. 52. The method according to claim 51, characterized in that the first transport protocol comprises a Transport Control Protocol / Internet Protocol (TCP / IP), and the second transport protocol comprises a User Datagram Protocol (UDP).
53. 53. The method according to claim 51, characterized in that the offers are communicated from the participants under the layer auction protocols above one of the first and second transport protocols. SYSTEM AND METHOD FOR IMPLEMENTING AN AUCTION IN A COMPUTER NETWORK SUMMARY OF THE INVENTION A provision to implement a computerized auction for participants of an auction based on the offers with firm support from the participants within pre-established limits. The proposed provision includes a communication network between an auctioneer and the participants to communicate the receipt of offers and the details of the status of the auction to the participants, and which determines a winner among the participants. The arrangement comprises a means of computer interconnection for the presentation of the offers, a means detector of each of the latter, a computer clock located at the auctioneer to establish start and end time of auction and a means of computer decision for the result. The invention also proposes a server for processing offers to be used by the arrangement with means for processing offers and communicating information through the computer network, and means for determining a winner and communicating the latter to the participants. The server also has means for transporting protocols to communicate information. It also proposes a method to implement the auction to be used by the provision.