+

WO2001027840A1 - Dispositif et procede de mise en oeuvre de transactions commerciales - Google Patents

Dispositif et procede de mise en oeuvre de transactions commerciales Download PDF

Info

Publication number
WO2001027840A1
WO2001027840A1 PCT/US2000/028102 US0028102W WO0127840A1 WO 2001027840 A1 WO2001027840 A1 WO 2001027840A1 US 0028102 W US0028102 W US 0028102W WO 0127840 A1 WO0127840 A1 WO 0127840A1
Authority
WO
WIPO (PCT)
Prior art keywords
bid
bidder
transaction
auction
bidders
Prior art date
Application number
PCT/US2000/028102
Other languages
English (en)
Other versions
WO2001027840A8 (fr
Inventor
Jeffrey Teich
Hannele Wallenius
Jyrki Wallenius
Alexander Zaitsev
Original Assignee
Negotiauction, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Negotiauction, Inc. filed Critical Negotiauction, Inc.
Priority to AU11964/01A priority Critical patent/AU1196401A/en
Publication of WO2001027840A1 publication Critical patent/WO2001027840A1/fr
Publication of WO2001027840A8 publication Critical patent/WO2001027840A8/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising

Definitions

  • An apparatus for and a method of implementing business transactions is provided.
  • buyers and sellers of goods and services are linked together over a network (e.g., the Internet) to facilitate resolution of business transactions (e.g., auctions, negotiations, markets).
  • a network e.g., the Internet
  • Transaction owners interface with a transaction server control processing of the business transaction.
  • Bidders desiring to enter into a business transaction with the business transaction owner preferably request recommended or suggested competitive offers (e.g., bid prices) which will allow the bidders to be "active" in the business transaction.
  • the transaction server can be placed in one of a plurality of different operational modes such as an automatic mode for automatically generating suggested offers.
  • a manual mode of t e server allows transaction owners the ability to directly communicate with a bidder to provide manual recommendations or suggestions for competitive offers to be among the "active" winners of the business transaction.
  • Figs, la and lb are block diagrams illustrating exemplary systems used to operate business transactions in accordance with a preferred embodiment of the invention
  • Figs. 2-4 are flow charts illustrating bidding processes in accordance with preferred embodiments of the invention.
  • Figs. 5-17 are screen images of an exemplary commercial implementation of a business transaction in accordance with a preferred embodiment of the invention.
  • Figs. 18a-18e collectively represent the process flow for an auction owner in an exemplary commercial implementation of a negotiauction transaction in accordance with a preferred embodiment of the invention
  • Figs. 19a and 19b collectively represent the process flow for an bidder in an exemplary commercial implementation of a negotiauction transaction in accordance with a preferred embodiment of the invention
  • Figs. 20a-20c collectively represent the process flow of an exemplary commercial implementation of a negotiauction transaction in accordance with a preferred embodiment of the invention.
  • Figs. 21-45 are screen images of an exemplary commercial implementation of a business transaction in accordance with a preferred embodiment of the invention.
  • the system illustrated in Fig. la may be provided in accordance with a preferred embodiment of the invention to facilitate business transactions such as auction transactions, negotiation transactions, market transactions, etc.
  • the system may be used to link buyers and sellers of goods and services in local or geographically remote regions around the world.
  • business transactions can be easily initiated and conducted between a transaction owner over interface 12 and one or more bidders using bidder interfaces 13a, 13b, 13c connected through a network 14 (e.g., the Internet).
  • a network 14 e.g., the Internet
  • Business transaction server 10 is provided to store the transaction details (e.g., name, address, subject item, price, quantity, etc.) and execute the transaction processes under control of the transaction owner through transaction owner inter 12.
  • transaction details e.g., name, address, subject item, price, quantity, etc.
  • business transaction server 10 is capable of operating and supporting a variety of business transactions such as auction transactions, negotiation transactions, market transactions, request for quote (RFQ) transactions, etc.
  • Transaction server 10 is particularly useful in operating and supporting negotiauction transactions, which, in accordance with a preferred embodiment of the invention, combine features of auction and negotiauction transactions, as will be described in detail below.
  • business transaction server 10 may include one or more central processing units (CPU) 100 used to provide processing of input/output data between transaction owner interface 12 and network 14, and among the different modules (all connected together via system bus 109) within transaction server 10.
  • CPU 100 typically executes one or more computer programs stored in the one or more memory devices graphically represented as memory module 102.
  • a mode controller 104 is provided to switch from among a plurality of operational modes within the processing of a given business transaction (as will be described below).
  • a bid calculation device 106 may be included within business transaction server 10 to calculate recommended or suggested bids for output to one or more of the bidder interfaces 13a, 13b, 13c, as will be described in more detail below.
  • a transaction criteria detector 108 may also be included to review bids (and their respective bidders) for compliance with one or more sets of criteria that may be applicable to a given business transaction, as will be described below.
  • the data sets representing applicable criteria are typically stored in a memory such as memory module 102 or any other remote or local memory structure.
  • Fig. lb depicts an exemplary commercial implementation of the business transaction system shown in Fig. la.
  • the system shown in Fig. lb is a Java-coded system that uses Web-based distributed computing as its platform.
  • a database 19, operating under control of database SQL server 18, is used to store information concerning the business transaction (e.g., auction), its users, bids, etc.
  • a Java application server 17 is provided as the main communication center. Application server 17 is coupled to SQL server 18 (directly or indirectly through Internet 16) to process all connections and requests from users (e.g., bidders, transaction owners, etc.) through client devices 15.
  • Java application server 17 houses the processing device(s) and programmed algorithm used to operate the business transaction (e.g., auction).
  • Client devices 15, in this implementation, are Java-enabled client devices gaining access to the Java application server 17 over Internet 16 using Java Remote Method Invocation (RMI) technology.
  • RMI Java Remote Method Invocation
  • the business transaction systems described above and illustrated in Figs, la and lb may be used to effectuate the business transactions and business methods described in (and apparent from) the specific embodiments, implementations, and illustrations provided below.
  • the business transaction owner defines the metes and bounds of the business transaction.
  • the owner may, for example, describe the subject or item of the transaction (e.g., good, product, service, etc.), the time period for conducting the transaction, etc..
  • the transaction owner may specify whether the transaction is to be "closed” or "open.”
  • the transaction owner may provide a fist of qualified bidders.
  • the transaction owner may assign bid premiums (or discounts) to each of the bidders.
  • the transaction is generally open to any bidder having access to the system. For that reason, the transaction owner may define a set of bidder attributes that must be met before a bidder is qualified to bid on the transaction.
  • the transaction owner may assign weight to the different attributes and rank bidders (e.g., using a simple weighted average scale) according to the attributes met. Bid premiums (or discounts) could similarly be assigned to different bidders based on ranking.
  • the transaction owner may also define a set of issues to be resolved in the transaction (sometimes referred to herein as "Negotiable
  • NBI issues such as price, quantity, quality, delivery, warranty, payment terms, or any known parameter impacting the parties in the transaction may be explicitly resolved (e.g., auctioned, negotiated, etc.), or implicitly resolved through the use of offer or bid premiums, discounts, etc.
  • NBI discounts for example, on bid prices may be awarded to individual bids (or bidders) based on the extent (or level) to which NBI issues are met (e.g., different delivery dates may be awarded different NBI discounts).
  • the transaction owner may also define criteria for the transaction that effectively place limits on the bidding and resolution of the transaction.
  • constraints may be placed generally on elements of the issues, NBIs or levels of NBIs, attributes of the bidders, quantity limits (e.g., maximum of 50% from risky suppliers, or 5,000 units for new suppliers), etc. Constraints may also specify that the transaction must be such that revenue must increase at every iteration, or that ties in bids are broken by making the most recent bidder inactive, etc.
  • the transaction owner may also set reservation prices, beginning bids, quantity discounts, and other parameters of the bidding or overall transaction process.
  • the definitions of the transaction as input by the transaction owner are then stored in the system for reference (e.g., by calculation device 106 (Fig. la)) during the processing of the transaction.
  • a buyer, seller, or other entity desiring to provide a competitive offer (e.g., a bid) in a business transaction typically steps through the process depicted in Fig. 2. For example, after first "qualifying" to bid by meeting the transaction owners minimum requirements (e.g., regarding bidder attributes, etc.), a bidder desiring to enter into a business transaction with a transaction owner enters the process (at step 20). In accordance with a preferred embodiment of the invention, the bidder requests a recommended or suggested bid (at step 22).
  • the bidder By requesting a suggested bid, the bidder need not determine for itself what form (e.g., price, quantity, quality, terms, etc.) the bid must take to gain a high probability of obtaining a winning position in the business transaction.
  • many of the elements or issues constituting the bid e.g., quantity, delivery, other NBI levels, etc.
  • any remaining bid issues e.g., price
  • the suggested bid will be calculated (e.g., by bid calculation device 106 (Fig. la)) and received by the bidder (at step 24).
  • the suggested bid is calculated such that the bidder would be placed in an "active" position in the business transaction if the suggested bid were adopted or accepted by the bidder.
  • a bidder with an "active" status or position at the time of closing of the business transaction would be deemed the winner (or at least in a group of winners) of the business transaction.
  • a bidder in an "inactive" position at the time of closing would not win (or be among the winners) of the business transaction.
  • a designation of "semi-active" status or position would be designated as such where parts of its bid (e.g., a partial quantity in a multiple quantity auction transaction) were considered “active” for purposes of determining winners of the business transaction, and the remaining parts of the bid were considered “inactive.”
  • the suggested bid is calculated (e.g., using calculation device 106 (Fig. la)) based on all of the criteria initially input by the transaction owner in defining the transaction (e.g., bid premiums/discounts, constraints, quantity discounts, bidder attributes, NBI discounts, reservation prices, etc.), as well as on factors such as previous bids.
  • the suggested bid price would be calculated assigning price premiums (or discounts) based on the extent to which the bidder met (e.g., as determined by criteria detector 108 (Fig. la)) the different auction definitions (e.g., delivery terms, warranty length, etc.).
  • the bidder Having received the suggested bid, the bidder is in a position to accept or reject the bid (at step 26). If electing to accept the suggested bid (or enhancing the bid further), the bid is output (at step- 28) to the transaction owner. If the bid is not accepted, no bid is output by the bidder. In either case, the process returns (at step 29) to other processing in the business transaction. Bidders may enter or re-enter (at step 20) for additional bids at any time while the business transaction remains open for bids.
  • bids are accepted sequentially, and when a bidder is outbid by another, the bidder is informed and invited to re-enter the process to post another bid.
  • the bidders will not see each others bids.
  • the process is simplified in that the bidders do not have to decide the constitution of their next bid (e.g., what amount to bid to make their bid "active"), relying instead on a bid being
  • step 24 (Fig. 2)). Additional features can be added to further simplify the process
  • composition e.g., reservation price for a given quantity.
  • Fig. 3 is provided as an illustration of one exemplary implementation of a
  • A: set of active bids (possibly empty), corresponding to indexes i 1, . . ., n when bids are ordered from lowest to highest
  • A/k the set of active bids reduced by k lowest priced active bids
  • SA set of one semi-active bid (possibly empty), corresponding to i l- l
  • the operation of the auction transaction is initiated (at step 30), and the
  • Auction owner specifies D, RP, ⁇ , and the closing time of the auction (at step 31).
  • That bidder requests (at step 33) calculation of a
  • iCase 1 Suggested Price is the Reservation Price. SP
  • the bidder submits (at step 34) its bid
  • bidder rejects the suggested bid). If, as a result of the submitted bid, the status of the bidder (and any other bidders) change, the bidders are notified of the status
  • the bids are then reorder from low to high (at step 36). The process is then repeated until auction closes (at step 38).
  • the revenue which is intended to increase at every iteration, can be
  • TotaJ revenue P ⁇ q, + qtr p lt it A
  • s refers to the semi-active bid.
  • Bidder 1 enters the auction, specifies a quantity of 40 and requests a price from the auction mechanism. Since there are no other bids, the reservation price is suggested to the bidder (case 1). He/she makes his/her bid (10, 40) and it becomes active in status.
  • Bidder 2 enters, specifies a quantity of 30 and requests a price. Again the reservation price of $10 is suggested (case 1), because the supply has not yet been depleted. Bidder 2 makes his/her bid (10, 30) and it becomes active in status.
  • bidder 3 enters the auction, and specifies a quantity of 50. At this point the supply is depleted and a new price must be calculated.
  • the auction mechanism calculates a price at the bid increment ($1) above the latest price, and a price of $11 is suggested to the bidder (case 2, rule b). He/she then makes his/her bid (11, 50). Bidder two then is outbid and thus becomes semi-active with a quantity of 10 units, because he/she was the last one to bid at the price of $10.
  • bidder two has three options. He/she can withdraw from the auction completely, stay semi-active in status, or re-bid. Assume he/she decides to re-bid at the same quantity of 30 units, and requests a price. The price $11 is suggested by the mechanism because at that price the quantities of bidders 2 and 3 would be met by the supply (case 2, rule b).
  • Bidder 2 then makes his/her bid (11, 30).
  • Bidder 3 remains active in status and bidder 1 becomes semi- active with a quantity of 20 units.
  • bidder 1 has, again, three options, i.e. withdraw, remain semi-active or re-bid.
  • Bidder 1 specifies a quantity of 40, and the suggested price is 9.5, the reservation level for that quantity.
  • Bidder 2 specifies a quantity of 30 and the suggested price is at the reservation level of 10.
  • Bidder 3 specifies a quantity of 50, but because he/she must outbid bidder 1, the suggested price is 10.
  • the algorithm mechanism then performs the same as above for the bids that follow since they now are above the reservation prices, as reflected in Table 2 below.
  • the operation illustrated in Fig. 2 can be further enhanced by adding a plurality of additional operational modes, as illustrated in Fig. 4.
  • the operational modes can be controlled (e.g., with mode controller 104 (Fig. la)) by the transaction owner to facilitate a resolution of the transaction.
  • three operational modes are depicted: automatic, manual, and pause.
  • a bidder enters (or re-enters) the bidding process (at step 40) of the business transaction and requests a bid (at step 42), in a manner similar to the process described above with respect to Fig. 2.
  • the process enters into one of the plurality of modes (at step 43).
  • the process of calculating a recommended or suggested bid is the same as in the process of Fig. 2.
  • the bidder then has an opportunity to accept or reject the bid (at step 46), output the bid (at step 48) to the transaction owner, and return (at step 49) to the remaining processing of the business transaction.
  • the bidder is essentially suspended from receiving a suggested bid (and from making any bids at all).
  • the pause mode may remain in effect for a predetermined period (e.g., given time period, given number of bid cycles, etc.), or indefinitely until the transaction owner moves the operational mode to another mode.
  • the transaction owner In the manual mode, the transaction owner itself (or another entity) manually interacts with the bidder directly (at step 45).
  • the transaction owner utilizes instant messaging systems, chat (text/video/audio) services, or other (real-time/non-real-time) communication devices to relay information to the bidder concerning a suggested bid that would be acceptable to the transaction owner.
  • the bidder Once the information is conveyed to the bidder, the bidder has the option of accepting the bid (at step 46) and outputting the bid (at step 48), as in the automatic mode. In either event, the bidder is returned (at step 49) to the remaining business transaction processing.
  • the information conveyed to the bidder from the transaction owner may involve a series of exchanges of information, offers, counteroffers, etc. that allows the transaction owner to effectively negotiate the terms with the bidder directly (in real-time, if preferred) during the processing of the transaction (e.g., auction).
  • the transaction owner is also provided with the ability to "lock-in” a manual mode bid.
  • the "lock- in” election commits the transaction owner to the bidder prior to the end of the transaction resolution period (e.g., before an auction ends).
  • the locked-in bidder is the winner (i.e., cannot be outbid) for the specified quantity.
  • the bid if accepted at step 46 by the bidder
  • the recommended or suggested bid calculation performed e.g., using bid calculation device 106 (Fig. la), at step 24 (Fig. 2), at step 44 (Fig. 4), etc.
  • the recommended or suggested bid calculation performed is performed in a manner that maximizes the benefit (e.g., increased revenue, decreased cost, etc.) received by the transaction owner in accepting another "active" bidder.
  • the process may be optimized by formulating and solving the following:
  • Each bid is represented by a pair (p, q) - - price per unit, quantity supplied in a reverse auction.
  • q and x can be used to define L additional constraints. Constraints that only concern a particular bidder or each bidder in some particular group can be checked at the time the bid is entered and need not be considered in the calculation. Only such constraints are considered which restrict the number of bids, the quantity or other criterion values for a group of bids.
  • each constraint can be represented in the foUowing format
  • the simplex method is used in the continuous case, and the Lend-Doyg method in the integer variable case. If there is no optimal solution, the nearest solution provided by the optimization method is checked. Two different cases are distinguished:
  • the recommended price is the auction reservation price set by the AO.
  • condition (2) or (2') should be added.
  • the business transaction owner e.g., auction owner (AO)
  • WiU calculate a suggested bid that is less than (in a reverse auction) a the calculation for a bidder without such a premium. Therefore, the recommended price calculation transforms to:
  • the auction owner can indicate that he wiU not give any discount
  • NBIs multiple issues i.e., NBIs. Associated with the levels within these NBIs, the NBIs
  • the Nef otiAuctionTM software depicted allows corporate and government buyers to b ld multiple issues into the bidding process such as a suppUers' defect history, warranty, brand value, deUvery time, quality level, etc. Buyers wiU also rate suppUers on any number of attributes such as ISO 9000, minority ownership, etc. Based upon the "non-price" criteria, called “Bidder Attributes (BAs),” buyers require some bidders to beat other bidders by an inflated level by applying "bid premiums" based upon ratings across BAs, and rankings of the bidders. Buyers are able to push the whole set of bidders to lower prices in real-time via open price competition. In Manual Mode, buyers can "NEGOTIATE WITH" individual bidders.
  • BAs Bidder Attributes
  • Nej otiAuction also provides benefits to suppUers.
  • SuppUers are constantly informed of the amount that they must bid to be "active" in the auction. This eliminates the guessing game that suppUers must often play when bidding on RFQ's. If a suppUer is active at the close of the auction, he wiU not be pushed further in price, deUvery terms, or any other issues. Since the procurement event takes place in real time, there wiU be no waiting period for suppUers to learn whether they have won the bid. And, suppUers wiU reduce their sales and marketing costs and the sales cycle since the NegotiAuctionTM onUne procurement process reduces the need for extensive person- to-person negotiation.
  • Fig. 5 shows the first screen an auction owner would see upon entering the system and specifying ⁇ New Auction>>.
  • the name of the auction is Example, the product descriptions is CD drives subject to standard, previously negotiated contract terms. The product must be deUvered within 30 days.
  • the auction type is reverse, as opposed to forward. The auction is not open to the world, the AO wiU invite aU bidders to the auction.
  • the AO further defines the auction in Fig. 6.
  • the quantity is specified, as weU as the currency and units of the bid.
  • the bid increment is also Usted under price delta.
  • the AO also indicates the closing time, and that he wiU be using bid premiums and at least one constraint. Also, the reserve price for the beginning bid is input.
  • the AO defines one of the two Bidder Attributes (BAs). This one refers to whether or not the bidder is ISO 9000 certified or not. The second attribute is a subjective rating on quaUty risk. Both BAs are input by the AO, although the system aUows an option for the bidders to input the data.
  • the AO then invites and registers three bidders into the auction. GS, TS, and SS all receive an invitation along with their usernames and passwords and a description of the auction.
  • the AO inserts the data for the BAs in Fig. 8.
  • the Bidder GS is scored a risk rating of 40, and GS is not ISO 9000.
  • a Umiting constraint on quantity is indicated in this screen. GS may not supply more than 100000 units.
  • the ranking screen is shown in Fig. 9.
  • the AO provides weights on the BAs, then selects sort by rank.
  • the system uses a simple weighted average to calculate a score which is then ranked. Once the ranks are in, the job of assigning Bid Premiums to the bidders is easier. Notice the top ranked bidder, TS has a 0 premium, and GS, the bottom ranked bidder has a premium of 1. This means that aU things being equal, GS must beat TS by $1 in a bid.
  • the AO's min screen is shown in Fig. 11, the bidders are aU Usted in the center, the NegotiAuction open at this time is in the upper left, and no bids have arrived yet in the positions window. The NegotiAuction has begun.
  • Bidders TS enters the auction, selects ⁇ New Bid>>, the bid screen pops. She enters a Quantity of 200,000. Since this is the first bid, the reserve price of $80 is returned. She agrees, hits yes, and her bid is shown active in her mainscreen in Fig. 12.
  • Bidder GS enters the auction, inserts a bid quantity of 120000 units, but since GS is constrained to 100,000 units, she receives the message in Fig. 13. She hits YES, and receives a price of $78.5 generated by the system. This price is the difference of the bid increment ($.50) combined with her $1 bid premium off the $80 price of TS. This bid makes TS semi-active.
  • the auction owner's screen is updated to show the current position in Fig. 14. Notice bidder TS is semi-active with 100,000 units in parentheses. At this point the AO beUeves he can push bidder TS a Uttle more by going into manual mode. He places TS in manual mode. When TS notices she has gone semi-active and wiU probably be outbid when the next bid arrives, she revises her bid.
  • Fig. 15 shows her screen with the message window attached. She enters a lower bid ($79) and goes back to the original quantity of 200,000. She also includes a message.
  • the manual mode bid arrives in RED and AO's screen in Fig. 16 shows the status «U» for Under consideration.
  • the counter-offer then goes RED in TS's screen. She opens the bid window, reads the message, then agrees to the $78.
  • FIG. 18a-18e Three flow charts (represented by Figs. 18a-18e, 19a, 19b, and Figs. 20a- 20c) and the corresponding description (appearing in the Appendix) of the operational flow depicted are provided as another exemplary commercial implementation of a preferred embodiment of the invention.
  • the auction owner upon entering the system, first defines the auction.
  • the Government (AO) is purchasing non-defective chemical weapons protection suits.
  • Fig. 21 the Government describes the product and specifies that the auction type is reverse, as opposed to forward.
  • the auction is open to the world however the government first qualifies bidders before aUowing them to bid.
  • the AO further defines the quantity demanded, as weU as the currency and units of the bid.
  • the bid increment is also Usted under price delta.
  • the AO also indicates the closing time, and that he wiU be using bid premiums and at least one constraint.
  • the reserve price for the beginning bid (assuming no Bid Premiums and no NBI discounts) is input.
  • the AO defines the two Bidder Attributes (BAs).
  • the first BA refers to whether the bidder is ISO 9000 certified or not.
  • the other attribute is a subjective rating on quaUty risk.
  • the data for both BAs are input by the AO, although the system aUows an option for the bidders to input the data, which could be the case if the set of bidders is large and the data is objective rather than subjective ratings.
  • the AO defines the two Negotiable Bid Issues (NBI), warranty years and deUvery in days.
  • NBI Negotiable Bid Issues
  • the AO defines the discount levels appUed to the levels in the NBI, warranty and deUvery respectively.
  • NBI discounts aUow the bidders to receive a better (higher) price when preferred levels of the NBI are placed in a bid. They are automaticaUy calculated into a requested price when the bidder selects the request price button after entering an NBI level.
  • the auction owner is indifferent between NBI level/discount combinations, so for example, in NBI warranty, the AO is indifferent to a warranty level of 2 years with a discount of $0, to a warranty level of 3 years with a discount of $3 per unit, and so on.
  • aU attributes of the auction, bidder attribute and NBIs are summarized for the auction owner.
  • Figs. 31, 32, and 33 the AO defines a constraint on the NBI deUvery, where the deUvery must be in 90 days or less.
  • Fig. 34 summarizes three constraints for the AO, one for each of the NBIs, and one "group" constraint on the bidder attribute ISO 9000. The group of bidders, together, without certification may not be assigned more than 450,000 suits. Later on, the AO wiU also specify constraints Umiting each individual bidder to a maximum of 400,000 units. The simplex method is underlying in the NegotiAuction algorithm to calculate an optimal solution, minimizing (maximizing) revenue, subject to the constraint set.
  • the AO invites and registers three bidders into the auction: GS, TS, and SS. They all receive an invitation along with their usernames and passwords and a description of the auction.
  • the AO rates each bidder on the BA quaUty risk, and they specify whether the bidders are ISO 9000 certified or not.
  • the AO switches the bidders from Pause mode (the default), to Automatic mode.
  • the AO provides weights on the BAs, then selects 'sort by rank' .
  • the system uses a simple weighted average to calculate a score, which is then ranked. Once the ranks are in, the job of assigning Bid Premiums to the bidders is easier.
  • the top ranked bidder (GS) is assigned $0 premium
  • SS is assigned a $12 bid premium
  • the bottom ranked bidder (TS) is assigned a premium of 20. This means that aU things being equal, TS must beat GS by $20
  • the negotiationAuction is set to begin.
  • the participants summary information is suppUed to the AO in Fig. 37.
  • bidder GS enters the auction, selects 'New Bid 1 , the bid screen pops. She enters an infeasible quantity of 500,000. The quantity is automaticaUy revised downward to a feasible quantity of 400,000 and since this is the first bid, the reserve price of $500 is returned. Recall bidder GS has a 0 bid premium, and the NBI levels selected by GS offer no discounts off the requested price.
  • GS agrees to the requested price and hits yes; her bid is then shown active in her main screen.
  • AU bidders have access to the NBI discount level information provided in Fig. 39, they select the level which provides the highest utiUty for the price/NBI level combination.
  • SS agrees to this requested price and becomes active in the auction.
  • GS becomes semi-active with a quantity of 300,000 units.
  • the calculation of the working price makes possible an "apples to apples” comparison possible between bids from bidders with different bid premiums and different NBI levels.
  • Bidder SS Assume bidder SS is placed into manual mode at this point by the AO. Bidder SS enters a manual mode bid in Fig. 43 with a request to "Lock-in" this bid.
  • Lock-in simply means that the AO agrees to the bid, and commits that quantity with the terms of the bid prior to the official close of the auction (thus the quantity avaUable in the auction is reduced by the amount of the locked-in bid).
  • the AO makes a counter offer to bidder SS.
  • SS responds to the counteroffer in Fig. 45 and restates her request to lock-in the bid. Her bid then becomes active and the
  • AO decides whether or not to lock-in.
  • the negotiationAuction continues in a simUar manner until the close. While preferred embodiments of the invention have been described and iUustrated, it should be apparent that many modifications to the embodiments and implementations of the invention can be made without departing from the spirit or scope of the invention. For example, while a business-to-business-type auction transaction has been specificaUy iUustrated, the invention may easUy be deployed in consumer- to -business, or consumer-to-consumer (forward or reverse) auction, negotiation, negotiauction, market, and RFQ transactions.
  • Additional modules may be added to interact with the auction processing system.
  • one or more additional operational modes added (or one or more removed) without departing from the scope of the invention.
  • the operational modes when implemented described may contain more or less functionaUty than described herein.
  • one or more user interfaces e.g., transaction owner interface 12, bidder interfaces 13a-13c, and cUent devices 15 in Figs, la and lb
  • PDAs personal digital assistants
  • WebTV (or other Internet-only) terminals, set-top boxes, cellular/PCS phones, screenphones, pagers, kiosks, or other known (wired or wireless) communication devices, etc.) may similarly be used to execute one or more computer programs (e.g., universal Internet browser programs, dedicated interface programs, etc.) to aUow users to interface with the systems in the manner described.
  • computer programs e.g., universal Internet browser programs, dedicated interface programs, etc.
  • the modules described herein may be one or more hardware, software, or hybrid components residing in (or distributed among) one or more local or remote computer systems.
  • the modules are shown or described as physically separated components, it should be readily apparent that the modules may be combined or further separated into a variety of different components, sharing different resources (including processing units, memory, clock devices, software routines, etc.) as required for the particular implementation of the embodiments disclosed herein. Indeed, even a single general purpose computer executing a computer program stored on an article of manufacture (e.g., recording medium) to produce the functionaUty and any other memory devices referred to herein may be utiUzed to implement the illustrated embodiments.
  • User interface devices may be any device used to input and/or output information.
  • the user interface device may be implemented as a graphical user interface (GUI) containing a display or the like, or may be a link to other user input/output devices known in the art.
  • GUI graphical user interface
  • Discrete functionaUty of the system may be separated (logically or physicaUy) to more efficiently operate the system.
  • memory units described herein may be any one or more of the known storage devices (e.g., Random Access Memory (RAM), Read Only Memory (ROM), hard disk drive (HDD), floppy drive, zip drive, compact disk- ROM, DVD, bubble memory, redundant array of independent disks (RAID), etc.), and may also be one or more memory devices embedded within a CPU, or shared with one or more of the other components.
  • RAM Random Access Memory
  • ROM Read Only Memory
  • HDD hard disk drive
  • floppy drive zip drive
  • compact disk- ROM DVD
  • bubble memory redundant array of independent disks
  • AO 1.3.1 AO defines auction, product description, hard requirements (rfq) and whether or not auction is open to the world of bidders or closed to a defined set
  • Lot size requirements e.g. PaUets with a specified number of units
  • BA Bidder Attributes
  • NBI Negotiable Bid Issues beyond price and quantity exist or not e.g., DeUvery time, warranty time,
  • constraints e.g., Limits for bidders, Umits for groups of bidders, minimum levels of nbi, if thens
  • System sends emaU to bidder with invitation to enter auction, auction description (rfq) and information
  • 1.5.5 AO may use messaging system to send any bidder a note
  • Bidder has option to accept, reject and exit, or change nbi levels and request price again
  • 2.10.3 AO either counters with a waiting (w) status bid, with a p,q, NBI levels and optional message or AO accepts initial and bid becomes active
  • At least one bid is active, another bid is entered
  • Request price working price of potentiaUy beat out bid (see 3.5.4.1) + NBI bid level price bonuses - bid premium - price delta

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Finance (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

L'invention concerne un dispositif et un procédé de mise en oeuvre de transactions commerciales. Dans un mode de réalisation préféré de l'invention, les acheteurs et les vendeurs de biens et de services sont en liaison via un réseau, tel qu'Internet (14), afin de simplifier la solution de transactions commerciales (p.ex. enchères, négociations, marchés). Les propriétaires des transactions sont en interface (12) avec un serveur de transaction (10) traitant les transactions commerciales. Les soumissionnaires (13a, 13b, 13c) souhaitant rentrer dans une transaction commerciale avec le propriétaire correspondant requièrent de préférence des offres compétitives (p.ex. prix bas) recommandées ou suggérées leur permettant d'être « actifs » dans ladite transaction. Dans un mode de réalisation préféré, le serveur de transaction peut être mis dans un mode de fonctionnement parmi plusieurs modes différents, tel qu'un mode automatique permettant de générer automatiquement les offres suggérées. Un mode manuel du serveur permet aux propriétaires des transactions de communiquer directement avec un soumissionnaire afin d'apporter des recommandations ou des suggestions manuelles pour que les offres compétitives figurent parmi les gagnants « actifs » de ladite transaction commerciale.
PCT/US2000/028102 1999-10-12 2000-10-12 Dispositif et procede de mise en oeuvre de transactions commerciales WO2001027840A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU11964/01A AU1196401A (en) 1999-10-12 2000-10-12 Apparatus for and method of implementing business transactions

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
US15839699P 1999-10-12 1999-10-12
US60/158,396 1999-10-12
US16209899P 1999-10-29 1999-10-29
US60/162,098 1999-10-29
US18946300P 2000-03-15 2000-03-15
US60/189,463 2000-03-15

Publications (2)

Publication Number Publication Date
WO2001027840A1 true WO2001027840A1 (fr) 2001-04-19
WO2001027840A8 WO2001027840A8 (fr) 2001-09-07

Family

ID=27388168

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2000/028102 WO2001027840A1 (fr) 1999-10-12 2000-10-12 Dispositif et procede de mise en oeuvre de transactions commerciales

Country Status (2)

Country Link
AU (1) AU1196401A (fr)
WO (1) WO2001027840A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1278139A1 (fr) * 2001-07-19 2003-01-22 Worldwideticket AG Système orienté client de transactions et d'accès à des lieux et des représentations
GB2386994A (en) * 2002-03-07 2003-10-01 Rockwell Electronic Commerce A transaction system facilitating negotiation and in which buyer requests bids/offers
US7401034B1 (en) * 2002-06-27 2008-07-15 Oracle International Corporation Method and system for implementing attribute-based bidding and bid comparison in an electronic exchange
WO2011047326A3 (fr) * 2009-10-15 2011-08-25 Collisse Group Ltd. Gestionnaire de fourniture d'activité d'entreprise dans un échange d'entreprise
US8108284B2 (en) 2002-06-27 2012-01-31 Oracle International Corporation Method and system for implementing an offer/counteroffer negotiation
WO2014182650A1 (fr) * 2013-05-06 2014-11-13 Furman Tony Système d'adjudication de dettes
CN109146648A (zh) * 2018-04-25 2019-01-04 福建圈子互联网金融服务有限公司 一种基于区块链的竞标方法及终端

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5835896A (en) * 1996-03-29 1998-11-10 Onsale, Inc. Method and system for processing and transmitting electronic auction information
US5890138A (en) * 1996-08-26 1999-03-30 Bid.Com International Inc. Computer auction system
US6012045A (en) * 1997-07-01 2000-01-04 Barzilai; Nizan Computer-based electronic bid, auction and sale system, and a system to teach new/non-registered customers how bidding, auction purchasing works
US6026383A (en) * 1996-01-04 2000-02-15 Ausubel; Lawrence M. System and method for an efficient dynamic auction for multiple objects
US6151589A (en) * 1998-09-10 2000-11-21 International Business Machines Corporation Methods for performing large scale auctions and online negotiations
US6161099A (en) * 1997-05-29 2000-12-12 Muniauction, Inc. Process and apparatus for conducting auctions over electronic networks

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6026383A (en) * 1996-01-04 2000-02-15 Ausubel; Lawrence M. System and method for an efficient dynamic auction for multiple objects
US5835896A (en) * 1996-03-29 1998-11-10 Onsale, Inc. Method and system for processing and transmitting electronic auction information
US5890138A (en) * 1996-08-26 1999-03-30 Bid.Com International Inc. Computer auction system
US6161099A (en) * 1997-05-29 2000-12-12 Muniauction, Inc. Process and apparatus for conducting auctions over electronic networks
US6012045A (en) * 1997-07-01 2000-01-04 Barzilai; Nizan Computer-based electronic bid, auction and sale system, and a system to teach new/non-registered customers how bidding, auction purchasing works
US6151589A (en) * 1998-09-10 2000-11-21 International Business Machines Corporation Methods for performing large scale auctions and online negotiations

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1278139A1 (fr) * 2001-07-19 2003-01-22 Worldwideticket AG Système orienté client de transactions et d'accès à des lieux et des représentations
GB2386994A (en) * 2002-03-07 2003-10-01 Rockwell Electronic Commerce A transaction system facilitating negotiation and in which buyer requests bids/offers
US7401034B1 (en) * 2002-06-27 2008-07-15 Oracle International Corporation Method and system for implementing attribute-based bidding and bid comparison in an electronic exchange
US8108284B2 (en) 2002-06-27 2012-01-31 Oracle International Corporation Method and system for implementing an offer/counteroffer negotiation
WO2011047326A3 (fr) * 2009-10-15 2011-08-25 Collisse Group Ltd. Gestionnaire de fourniture d'activité d'entreprise dans un échange d'entreprise
WO2014182650A1 (fr) * 2013-05-06 2014-11-13 Furman Tony Système d'adjudication de dettes
CN109146648A (zh) * 2018-04-25 2019-01-04 福建圈子互联网金融服务有限公司 一种基于区块链的竞标方法及终端

Also Published As

Publication number Publication date
AU1196401A (en) 2001-04-23
WO2001027840A8 (fr) 2001-09-07

Similar Documents

Publication Publication Date Title
Bapna et al. INSIGHTS AN
US6892186B1 (en) Auction method and apparatus for electronic commerce
US7792713B1 (en) Method and system for disguised price bidding in online auctions
US8332302B1 (en) Method and apparatus for auctioning items
US20020138402A1 (en) Agents, system and method for dynamic pricing in a reputation-brokered, agent-mediated marketplace
US20080313089A1 (en) Multiple Option Auction Method and System
US20020161691A1 (en) Real-time internet auction system
EP1267293A1 (fr) Système et procédé pour le commerce dans un marché exclusif
WO2001053929A9 (fr) Procede et systeme permettant de mettre aux encheres des quantites partielles selon un classement
US7536362B2 (en) Method for selecting an optimal balance between direct cost and a number of suppliers
JPH11353361A (ja) 通信ネットワークによる商品販売システム
WO2001052135A1 (fr) Procede destine a offrir un prix d'achat optimal dans le contexte du commerce electronique
Klaue et al. Automated negotiation on agent-based e-marketplaces: an overview
WO2001027840A1 (fr) Dispositif et procede de mise en oeuvre de transactions commerciales
Kurbel et al. Towards multi-agent electronic marketplaces: what is there and what is missing?
US20150213531A1 (en) Computer-Assisted Interactive Reverse Auctions
US7415427B2 (en) Method, computer network, and signal-bearing medium for performing a negotiation utilizing pareto-optimization
US7840476B1 (en) Transformation bidding with tooling requirements
WO2001053913A2 (fr) Procede et systeme de correction des defaillances du marche lors de la localisation d'un participant dans des ventes aux encheres en ligne de type encheres au rabais
US20030135444A1 (en) Multiple award optimization
Erhun et al. Game theory in business applications
US20050234810A1 (en) Joint purchase reverse auction control method, computer program product and server
US20040254875A1 (en) Conduct of automated negotiation
Hobson E-negotiations: creating a framework for online commercial negotiations
US20040254847A1 (en) Automated negotiation with multiple parties

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
AK Designated states

Kind code of ref document: C1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: C1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

WR Later publication of a revised version of an international search report
122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载