WO2001033401A2 - Galerie marchande et vente aux encheres electroniques basees sur des specifications commerciales adaptatives - Google Patents

Galerie marchande et vente aux encheres electroniques basees sur des specifications commerciales adaptatives Download PDF

Info

Publication number
WO2001033401A2
WO2001033401A2 PCT/US2000/030323 US0030323W WO0133401A2 WO 2001033401 A2 WO2001033401 A2 WO 2001033401A2 US 0030323 W US0030323 W US 0030323W WO 0133401 A2 WO0133401 A2 WO 0133401A2
Authority
WO
WIPO (PCT)
Prior art keywords
ats
traders
trader
auction
adaptive trade
Prior art date
Application number
PCT/US2000/030323
Other languages
English (en)
Other versions
WO2001033401A9 (fr
WO2001033401A8 (fr
Inventor
Alex Brodsky
Stanislav Zelivinski
Marcel Katz
Alan Gozhansky
Sonya Karpishpan
Original Assignee
Adaptive Trade, 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 Adaptive Trade, Inc. filed Critical Adaptive Trade, Inc.
Priority to AU12485/01A priority Critical patent/AU1248501A/en
Priority to CA002390216A priority patent/CA2390216A1/fr
Priority to EP00974055A priority patent/EP1226537A2/fr
Priority to IL14935000A priority patent/IL149350A0/xx
Publication of WO2001033401A2 publication Critical patent/WO2001033401A2/fr
Publication of WO2001033401A8 publication Critical patent/WO2001033401A8/fr
Publication of WO2001033401A9 publication Critical patent/WO2001033401A9/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/06—Buying, selling or leasing transactions
    • G06Q30/08—Auctions

Definitions

  • This invention relates to conducting trade activities within an Electronic Marketplace where the participants are represented through Adaptive Trade Specifications (ATS)
  • ATS Adaptive Trade Specifications
  • An Electronic Marketplace is comp ⁇ sed of Electronic Malls and Electronic Auctions. Background - Discussion of Prior Art
  • the existing Electronic Auctions offer regular direct and reverse-auction methods. They have mainly the following characteristics:
  • the auctioned bundle consists of one or many items of a single specific type. There is no auction
  • Bids consist of a monetary amount.
  • Ranking based on previous customers' feedback. - Predict customers' preferences based on past customers' buying patterns and profiles.
  • MM ATS Based Match Making
  • the invention proposes the inclusion of
  • ATS ATS-based Match Making and Optimization
  • Wizards for various types of traders.
  • ATS constraints include restrictions (on quantities, prices, totals, profits, revenues etc.) that must be satisfied
  • each ATS is a specification of "items" the trader offers to GIVE as well as “items” to TAKE in return.
  • a procurement organization may offer to GIVE the "item” money and wants to
  • An office equipment supplier may have an ATS, in which all
  • manufacturer may have an ATS, in which all of its products appear as GIVE items, all raw
  • an ATS of a trader may be constraint-based and not fixed.
  • an ATS of a trader may
  • the MMO method recommends specific transactions with other traders (i.e.,
  • ATS e.g., minimal price, maximal profit etc.
  • A indicate exactly with whom the transaction should be made, the exact GIVE and TAKE items and their quantities, as well as other relevant parameters (e.g., price and profit).
  • the MMO method recommends a set of suppliers ATS's and the exact quantities of the items to be purchased from each, so that the procurement ATS objective, say the minimal total cost, is achieved.
  • the MMO method can recommend a set of buyers ATS's interested in the manufacturer's products, and a set of ATS's suppliers of raw materials necessary to manufacture the products, so that the manufacturer's obj ective, say maximal profit, is achieved.
  • the ATS-based match making and optimization are generic and work uniformly regardless of a specific wizard (or trader type) that generated them.
  • predefined wizards i.e., specialized "smart" interface templates
  • the wizard automatically constructs an ATS from the user given set of trading parameters relevant to a trading scenario.
  • the trader who uses a wizard does not need to understand the mathematical description of an ATS, but rather trading parameters and concepts that are familiar to the trader (e.g. availability, quantity, price, revenue, etc.).
  • the list of Wizards and examples of types of traders that may participate in the Electronic Market are described in the above-cited applications.
  • the disclosure allows creating new paradigms for the electronic marketplace as follows:
  • an ATS-based shop trades one or more ATS's, rather than just selling items.
  • an ATS-based trader can sell items as a "regular" shop (i.e., have a supplier ATS), or procure (i.e., have a procurement ATS), or offer manufacturing capability (i.e., have a manufacturing ATS) etc.
  • a "regular" shop may be selling a long list of items
  • an ATS-based trader shop is likely to have only a small number of, and often just one, ATS.
  • an office supplies shop may include its entire catalog of
  • the price function (e.g., based on price per item and volume discounts).
  • a visiting trader can immediately perform a transaction with any ATS in the mall, provided it is mutually agreeable with the visitor's ATS.
  • each bid is a monetary amount; and the outcome is a single winner who offered the
  • each (partial) bid is an ATS; and the outcome may be one
  • Bids could be ATS-based offers from buyers (procurement organizations). Each such
  • ATS bid may indicate, as TAKE items, only some, not all, of the surplus items, and have
  • ATS bids from all auction participants, and performs a match-making that optimizes the
  • the auction is a set of "winning” ATS's and the exact recommended quantities (quantities of items in the surplus to be sold to each "winner” so that the maximal overall revenue will be
  • ATS auctions provides the best of both worlds: a single auction, no restrictions on potential participants, and the optimal outcome for the auction initiator (ATS).
  • the ATS auction is generic for any auctioned ATS and bid ATS's, regardless of how (or using which wizard) they were generated. Thus, one could also auction a procurement ATS, in which case suppliers and manufacturers may be potential bidders. Or, one could auction a manufacturing ATS, in which case procurement organizations as well as raw material suppliers may be potential bidders. Thus, in addition to its flexibility, ATS auctions capture "direct”, “reverse”, and any "in-between” auctioning, depending on the ATS being auctioned.
  • An Electronic Marketplace that specializes in a particular type of commerce (e.g. auctions) may plan to expand into additional types of commerce (e.g. electronic malls, reverse-auctions etc.).
  • additional types of commerce e.g. electronic malls, reverse-auctions etc.
  • the same basic primitives Adaptive Trade Specifications, Match-Making, Optimization
  • Match-Making, Optimization will be reused in the expanded system, without requiring a full re-engineering of the existing system.
  • the only change will occur at the Wizard interface level.
  • the same advantage is evident when an existing marketplace is expanding from particular vertical markets (e.g. pharmaceuticals, electronics) to additional new vertical markets (e.g. automotive, financial).
  • FIG. 1 ATS-Based Trading Software System, describes a high level graphical summary of the suite of software tools related to the ATS-Based Trading Software System.
  • FIG.2 ATS-Based Match-Making and Optimization Hardware Architecture Diagram, describes a high level graphical summary of the hardware architecture of the system.
  • FIG. 3 Item Specification and Adaptive Trade Specification (ATS) Class Diagram, presents a high level graphical summary of the Item Specification and Adaptive Trade Specification classes.
  • FIGS. 4A-4E Functional Diagram of Match-Making and Optimization Method present a high level graphical summary of five Mathematical Programming Optimization Methods used by the system.
  • FIGS. 5A-5E Flow Charts of Specific Match-Making and Optimization Methods, present in greater detail the methods of Figs. 4A-4E.
  • FIG. 6 ATS Based Electronic Mall State Diagram, presents a high level graphical summary of the ATS Based Electronic Mall.
  • FIG. 7 ATS Based Electronic Auction State Diagram, presents a high level graphical summary of the ATS Based Electronic Auction.
  • FIG. 1 shows an overview of the operations carried out by the preferred embodiment.
  • ATS-based electronic marketplace 101 can include one or more of an ATS-based electronic mall 103, an ATS-based electronic auction (forward or reverse) 105, and any other ATS-based commerce environment.
  • participants in the marketplace 101 form ATS's through various techniques.
  • One such technique is the use of wizards 107, including one or more of a procurement wizard 109, a supplier wizard 111, a manufacturing wizard 113, a surplus seller wizard 115, a reseller wizard 117, a generic buy and sell wizard 119, a generic buy wizard 121, a generic sell wizard 123, a trade-in wizard 125, and other wizards adapted to specific purposes.
  • wizards like those wizards that are known in the programming art, are utilities that guide a user through a specific task.
  • the ATS's formed through use of the wizards 107 are input to the ATS match-maker 127,
  • the processes performed by the matchmaker 127 are object-oriented and follow the
  • CSPACE Oriented Database
  • IQL iterative query language
  • MIP mixed integer programming
  • the hardware architecture capable of running an ATS based match-making
  • optimization system includes several logical tiers, each one performing specific computational
  • Each tier can be described in terms of specific tasks that it performs. From the hardware
  • Tier 1 includes a database server 201 , which is a power server machine (preferably dual or quad Pentium III machine) running one of the following network operating systems : Windows
  • the database server 201 performs all tasks related to data
  • the database server 201 runs one of the commercially
  • object oriented databases such as Poet, Objectivity, Object Store, etc.
  • Tier 2 includes the application server 203, which is a power server machine (preferably
  • Tier 3 includes a Web server 205, which is a computer that responds to requests from Web
  • the Web server 205 transfers text files and corresponding graphics and data via HTTP to remote computers that are running Web browsers.
  • the Web server 205 should have the functionality commonly associated with e-commerce Web servers, such as CGI (Common Gateway Interface), JSP, ASP, etc., for performing searches and other dynamic HTML functions and SSL (Secure Socket Layer) for handling secure transactions.
  • FIGS. 4A-4E provide a high level graphical description of the methods outlined below.
  • Figs. 5A-5E provide corresponding low-level descriptions.
  • Step 501 Construct Original-ATS-Constraints as Constraints of A 1 AND Constraints of A2 AND
  • Step 505. Construct Take-Quantity-Constraints as follows: a. Initially, set Take-Quantity-Constraints to the empty conjunction (logical AND) of constraints, i.e. a constraint that is equivalent to FALSE. b.
  • Step 509 Construct the set All-Take-Item-Specs as follows: a. Set All-Take-Item-Specs to the empty set. b. For each ATS A from the input set ⁇ Al, ...,An ⁇ of ATS's do:
  • Quantity fgIS, tISJ expresses the quantity of glS given toward the required quantity of tlS )
  • Step 513 Construct Take-Zero-Sum-Constraints as follows: For each item specification tlS from All-Take-Item-Specs do: a. Set Zero-Sum-Constraints [tISJ to
  • Quantity [tlS] Quantity [gIS-1, tlS] + ... + Quantity [gIS-n, tlS] where gIS-1, ...,gIS-n are all item specification from All-Give-Item-Specs that
  • t/S-7, ..., tIS-m are all item specifications from All-Take-Item-Specs.
  • Step 515 Construct Give-Zero-Sum-Constraints as follows: For each item specification tlS from All-Give-Item-Specs do: a. Set Zero-Sum-Constraints [glS] to
  • Quantity fglSJ Quantity [glS, tIS-1] + ... + Quantity [glS, tIS-m]
  • Zero-Sum-Constraints [glS- 1 J AND ... AND Zero-Sum-Constraints [gIS-n] where gIS-1, .... gIS-n are all item specifications from All-Give-Item-Specs.
  • Step 517 Construct Constraints as Original-Constraints AND
  • Step 519 Return Constraints as output.
  • Input (409): 1. A set ⁇ Al, ...,An ⁇ of ATS's (411) 2. Objective of the class Objective-Class (recall: it includes an Objective-Function and an indication whether minimum or maximum is sought. (413) 3. Additional-Constraints, which can be used to describe additional interrelationships among numeric variables in different ATS's in ⁇ A I, ..., An). (415) Output (417): 1. An Optimal-Variable-Instantiation into all variables that appear in MM- Constraints( ⁇ Al, ...,An ⁇ ) (including quantities of all item specifications) that achieves the optimal objective of the Optimizing- ATS. (419) 2. The Optimal-Value for the Objective-Function for the Optimal-Variable-Instantiation. (421)
  • Step 523 Construct Combined-Constraints as MM MM-Constraints AND Additional-Constraints
  • Steps 525-529 If Objective indicates that minimum is sought (step 525), apply the method Minimize(Obj ective-Function, Combined-Constraints) (step 527) that returns the optimal Value-
  • At-Point (Recall: it has the attributes Optimal-Value of the type Real and Optimal-Point of the class Variable-Instantiation-Class). Otherwise, if Objective indicates that maximum is sought, apply the method Maximize(Obj ective-Function, Combined-Constraints) (step 529) that returns the optimal Value- At-Point. (Recall: it has the attributes Optimal- Value of the type Real and Optimal-Variable-Instantiation of the class Variable-Instantiation-Class).
  • Step 531 Initialize Winning- ATS- Set as ⁇ Al, ...,An ⁇ .
  • Step 533 For every ATS A in Winning-ATS-Set do: a. For every item specification 7S in Give-Item-Entries of A do: If Quantity [IS] is instantiated to 0 by the variable instantiation Value- At-Point then
  • Committed-ATS-Sel which is a set of ATS's that are committed to perform a transaction if
  • Constraints ( ⁇ Optimizing- ATS ⁇ union Committed-ATS-Set) (including quantities of all item
  • Step 541 Set ATS-Set to the union of Committed-ATS-Set and the singleton set
  • Step 545 Set Additional-Constraints to the empty conjunction of constraints, i.e., the constraint equivalent to TRUE.
  • Step 547 Apply the method ATS-Multiple-MM-Optimization(ATS-Set, Objective,
  • Step 549 Return Optimal-Variable-Instantiation, Optimal-Value and Winning-ATS- Set as output. End of Method
  • Input (443): 1. Optimizing- ATS, which is an ATS whose Objective will be used for optimization. (445) 2. Committed-ATS-Set, which is a set of ATS's that are committed to perform a transaction if and only if their Constraints are satisfied. The Objectives of the committed ATS's are not used in optimization. (447) Output (449):
  • Step 557 Apply ATS-Multiple-MM-Optimization on the set ⁇ Optimizing-ATS, A ⁇ of ATS's, the Objective of Optimizing-ATS, and the empty Additional-Constraints. Steps 559-565. If the returned Optimal-Value ⁇ Current-Minimum, as determined in step 559, do:
  • Step 561 Set Current-Minimum to Optimal-Value; Step 563. Set Current-Variable-Instantiation to the returned Optimal- Variable-Instantiation.
  • Step 565 Set Winning-ATS to the current ATS A.
  • Step 567. Return as output: Winning-ATS
  • Step 557 Apply ATS-Multiple-MM-Optimization on the set ⁇ Optimizing-ATS, A ⁇ of ATS's, the Objective of Optimizing-ATS, and the empty Additional-Constraints. Steps 559-565. If the returned Optimal-Value > Current-Minimum, as determined in step 559, do:
  • Step 561 Set Current-Maximum to Optimal- Value;
  • Step 563 Set Current-Variable-Instantiation to the returned Optimal- Variable-Instantiation.
  • Step 565 Set Winning-ATS to the current ATS A.
  • Step 567 Return as output: Winning-ATS
  • Step 571 For each K ATS's ⁇ Al, ...,Ak ⁇ in Committed-ATS-Set, perform ATS-One-to- All-MM-optimization(Optimizing-ATS, ⁇ Al, ...,Ak ⁇ ).
  • Step 573 Among all sets ⁇ Al, ...,Ak ⁇ , choose the one that has minimal (or maximal, as required in Optimizing-ATS) Optimal-Value.
  • the ATS Based Electronic Mall allows several kinds of traders to participate in the activities within the electronic mall.
  • the traders are individuals and organizations that can be categorized as procurers, suppliers, manufacturers, collaborating bidders, surplus sellers etc. However, these categories of traders have an underlying common representation. They all represent their trade items and trade objectives via ATS.
  • Each ATS is built using a specific Wizard.
  • the ATS's and Wizards have been described above and are described in still further detail in the above-cited related patent applications.
  • the present application describes how transactions between ATS's are performed in an Electronic Mall.
  • An ATS in the Electronic Mall can be exactly in one of the following two states:
  • the Objective Function of an ATS in Committed state is dormant.
  • a trader that owns a non-committed ATS can launch an optimization function for this ATS and request a recommendation for optimum trade according to his objective function. This function will be performed against other committed ATS's in the electronic mall.
  • a trader in the electronic mall can own both committed and non-committed ATS's.
  • a collection of committed ATS's is analogous to a shop in the Electronic Mall, and a non-committed ATS is analogous to a shopper.
  • a shopper can buy from one or more shops, sell to one or more shops, or perform a combination of both buying and selling.
  • the shopper (the non-committed ATS) is examining the shops (the committed ATS's) trying to find an optimal trade that will suit his needs.
  • the system will recommend which items and quantities from which shops should the shopper buy or sell or both.
  • the system comprises of a database that contains at least the following information:
  • All-Draft-A TS The set of all ATS ' s saved as draft for this trader.
  • actions e.g. optimization, search etc.
  • the diagram in FIG. 6 describes the process of trading in the ATS-based Electronic Mall.
  • the diagram is composed of states, user inputs, and methods.
  • the diagram is composed by the following states:
  • This state presents the end user with a graphical window that allows him to perform a series of user inputs. Each user input triggers an Action/Method. These user inputs are performed by the user by selecting a button in the window.
  • the Wizard is a graphical template that facilitates creation of ATS's and is described in detail in one of the above-referenced patent applications.
  • the Wizard used for this method is taken from an extensible library of wizards (i.e., specialized "smart" interfaces) developed for various types of traders (e.g., suppliers, procurement organizations, manufacturers, etc.).
  • libraries of customized wizards will be developed to accommodate specifics of various vertical markets (e.g., pharmaceuticals, electronics, office supplies etc.)
  • specialty wizards will be developed as solutions to individual corporate customers.
  • ATS Adaptive Trade Specification
  • Output A window displaying the selected ATS.
  • This method allows the user to select an ATS for view only. No modifications or any other operations are allowed on this ATS. If the trader is not the owner of the ATS that was selected for view, the system can deny his request if the original creator of the ATS restricted the viewing permissions on the ATS . ATS permissions and ownership are not covered by this patent. It sufficient to say that the creator of an ATS has read and write permissions on the ATS. Other traders in the system have read only permission or no permission on the ATS.
  • Input User selects an ATS for edit from an ATS list displayed in the window.
  • Output A window displaying the selected ATS.
  • This method allows the user to select an ATS for view and create his own copy of the ATS. This allows the trader to use an existing ATS as a template for the creation ofa new ATS. The user becomes the owner of newly created ATS.
  • Input User selects an ATS for removal from an ATS list displayed in the window.
  • Output Updated Database. Description:
  • This method allows the user to remove an ATS from the database. All references to this ATS will be updated.
  • Input User selects Submit ATS to Mall option.
  • Output An ATS in a committed state in the database. Description:
  • This method allows the user to submit an ATS to the mall.
  • the ATS is saved in the database and is committed to participate in any transactions that satisfy its constraints.
  • This state presents the end user with a graphical window that allows him to perform a series of user inputs. Each user input triggers an Action/Method. These user inputs are performed by the user by selecting a button in the window.
  • Input User inputs search criteria (trader name, quantity, item name etc.).
  • Output A set of ATS's that meet these criteria.
  • This method allows the user to perform a search against the ATS's database using a variety of search criteria (e.g. trader name, quantity, item name, item property).
  • search criteria e.g. trader name, quantity, item name, item property.
  • One or more search criteria can be simultaneously entered and a Boolean combination of these criteria can be specified.
  • the filtering can be performed using the Match-Making Optimization method or traditional search paradigms. For example a trader can issue a search for all ATS's in the database that are mutually agreeable with all items in the current ATS, or mutually agreeable with specific items in the trader's current ATS.
  • the trader can specify traditional search criteria such as retrieving all ATS's that belong to a certain trader, or that belong to a trader from a specific geographical location.
  • the trader is presented with a list of ATS that answer his search criteria. The trader may select the ATS's that will participate in the Match-Making Optimization process.
  • the Match-Making Optimization process recommends specific transactions with other traders (i.e., against their ATS's) that are mutually agreeable and optimize the objective of the trader's ATS (e.g., minimal price, maximal profit etc.).
  • the recommended set of transactions will indicate exactly with whom the transaction should be made, the exact GIVE and TAKE items and their quantities, as well as other relevant parameters (e.g., price and profit).
  • the MM optimization methods can recommend a set of suppliers ATS's and the exact quantities of the items to be purchased from each, so that the procurement ATS objective, say the minimal total cost, is achieved.
  • the MM optimization methods can recommend a set of buyers ATS's interested in the manufacturer's products, and a set of ATS's suppliers of raw materials necessary to manufacture the products, so that the manufacturer's objective, say maximal profit, is achieved.
  • the ATS- based match making and optimization are generic and work uniformly regardless of how or for what type of trader the input ATS's were generated (e.g., what "wizard" interface generated them).
  • This state presents the end user with a graphical window that allows him to perform a series of user inputs. Each user input triggers an Action/Method. These user inputs are performed by the user by selecting a button in the window. These are the user inputs that originate from this state and their respective triggered methods :
  • Committed-ATS-Set which is a set of ATS's that are committed to perform a transaction if
  • Constraints( ⁇ Optimizing-ATS, Winning-ATS ⁇ ) including quantities of all item specifications) that achieves the optimal objective of the Optimizing-ATS.
  • Optimizing-ATS which is an ATS whose Objective will be used for optimization.
  • Committed-ATS-Set which is a set of ATS's that are committed to perform a transaction if
  • Constraints ( ⁇ Optimizing-ATS ⁇ union Committed-ATS-Set) (including quantities of all item specifications) that achieves the optimal objective of the Optimizing-ATS.
  • Committed-ATS-Set which is a set of ATS's that are committed to perform a transaction if
  • Constraints ( ⁇ Optimizing-ATS ⁇ union Winning-ATS-Set) (including quantities of all item specifications) that achieves the optimal objective of the Optimizing-ATS.
  • the system will notify the owners of the affected ATS's that items from their ATS ' s are involved in a specific committing transaction.
  • the system will update the affected items of all participating ATS's in the database. If the transaction fails because of changes in the participating ATS's, or other software or hardware failures, the owner of the optimizing ATS will be notified accordingly.
  • the system will issue contractual, financial, and legal procedures to complete the transaction. The details of these procedures are beyond the scope of this patent.
  • the auctioned bundle (or item) is fixed and indivisible; each bid is a monetary amount; and the outcome is a single winner who offered the highest bid.
  • the auctioned bundle is an ATS (and thus dividable among different bidders); each bid is an ATS; and the outcome may be one or many winners, with whom the auctioning trader will perform a mutually beneficial multiple combined transaction.
  • the ATS Based Electronic Auction allows a certain participant (represented by one or many ATS's) to participate simultaneously in multiple concurrent auctions.
  • the match-making engine will notify the participant when her ATS was affected by one or more concurrent auctions. Since the system treats all auctions as one match-making and optimization pool of auctions, it can affect ATS 's that take part in different auctions. Each auction will notify the owner of an affected ATS at the auction's expiration time. If two or more auctions have an identical expiration time, the system will differentiate them based on a universal unique identifier assigned to the auction at its instantiation.
  • the ATS Based Electronic Auction will allow several kinds of traders to participate in the activities within the electronic auction.
  • the traders will be individuals and organizations that can be categorized as procurers, suppliers, manufacturers, collaborating bidders, surplus sellers, etc. However, these categories of traders have an underlying common representation. They all represent their trade items and trade objectives via ATS. Each ATS is built using a specific Wizard. In an ATS Based Electronic Auction all the ATS's involved are in a committed state.
  • the participants in the auction can choose between two states of ATS visibility. Their ATS 's can be either visible to other traders or hidden from other traders. An auction where the participant ATS's are hidden may benefit the auctioneer by boosting the highest bid he can obtain.
  • a single round auction is an ATS based electronic auction where only one round of bidding is allowed for each bidder. The auction is concluded when the time set a priori by the auction initiator has expired.
  • a surplus seller initiates an auction with a surplus ATS that has the objective of maximizing the overall revenue (whether the entire surplus or only part of it will be sold).
  • Bids could be ATS-based offers from buyers (procurement organizations).
  • Each such ATS bid may indicate, as TAKE items, only some, not all, of the surplus items, and have constraints on the quantities and prices offered (as in any ATS, it may involve flexible, rather than fixed, quantities and cost functions).
  • the systems collects the latest ATS bids from all auction participants, and performs a match-making that optimizes the objective of the auctioned ATS (the maximal overall revenue, in our example).
  • the outcome of the auction is a set of "winning" ATS's and the exact recommended quantities (quantities of items in the surplus to be sold to each "winner" so that the maximal overall revenue will be received).
  • ATS auctions provide the best of both worlds: a single auction, no restrictions on potential participants, and the optimal outcome for the auction initiator (ATS).
  • a multiple round auction is an ATS based electronic auction where more than one round of bidding is allowed for each bidder. The auction is concluded when the time set a priori by the auctioneer has expired.
  • An Auction State is defined as set of affected items in each bidding ATS that is among the projected winning bids, at a specific time within the life span of the auction.
  • the Auction State describes the instantiated ATS's as a result of applying the Match-Making Optimization mechanism.
  • the system updates the Auction State when a new ATS is entered as an auction bid, when a bidder changes an ATS, and when a bidder removes and ATS from the auction.
  • the bidder can view the Auction State, evaluate which items in her ATS are being engaged into a potential trade, and retrieve his ATS in order to perform a change. If the bidder retrieves an ATS for change, a copy of the original ATS remains active in the auction, until he commits the new changes. After the new changes are committed, the system will trigger the Match-Making Optimization mechanism in order to update the Auction State.
  • an ATS participates concurrently in more than one Multiple Round Auction, the system will update the Auction State of the first time-wise relevant auction in which the bidder participates.
  • the termination of the auction will trigger a final Match-Making and Optimization cycle, and will establish a final Auction State. This state will reflect the distribution of the auctioned items among the participants.
  • a surplus seller initiates an auction with a surplus ATS that has the obj ective of maximizing the overall revenue (whether the entire surplus or only part of it will be sold).
  • Bids could be ATS-based offers from buyers (procurement organizations).
  • Each such ATS bid may indicate, as TAKE items, only some, not all, of the surplus items, and have constraints on the quantities and prices offered (as in any ATS, it may involve flexible, rather than fixed, quantities and cost functions).
  • a new trader submits his ATS as a bid. The system will perform an Match-Making and Optimization cycle taking into account the new ATS and will present the new
  • the trader can change specific constraints on items within her ATS (e.g. quantity, unit price, availability etc.) in order to improve his chances of "winning” the auction. This process can be repeated by the same trader or by other traders until the auction expires.
  • the systems collects the latest ATS bids from all auction participants, and performs a match-making that optimizes the objective of the auctioned ATS (the maximal overall revenue, in our example).
  • the outcome of the auction is a set of "winning" ATS's and the exact recommended quantities (quantities of items in the surplus to be sold to each "winner” so that the maximal overall revenue will be received).
  • the system comprises of a database that contains at least the following information:
  • the diagram in FIG. 7 describes the process of trading in the ATS-based Electronic Auction.
  • the diagram is composed of states, user inputs, and methods.
  • the diagram is composed of the following states:
  • This state presents the end user with a graphical window that allows him to perform a series of user inputs. Each user input triggers an Action/Method. These user inputs are performed by the user by selecting a button in the window.
  • ATS Construction Method 704 Method Name: ATS Construction. Input: User input in the Construction Wizard. Output: An A TS. Description:
  • the Wizard is a graphical template that facilitates creation of ATS's and is described in detail in a co-pending patent application referenced above ("Automated Methods for Creation of Adaptive Trade Specifications").
  • the Wizard used for this method is taken from an extensible library of wizards (i.e., specialized "smart" interfaces) developed for various types of traders (e.g., suppliers, procurement organizations, manufacturers etc.
  • libraries of customized wizards will be developed to accommodate specifics of various vertical markets (e.g., pharmaceuticals, electronics, office supplies etc.)
  • specialty wizards will be developed as solutions to individual corporate customers.
  • ATS Adaptive Trade Specification
  • Input User selects an ATS for view from an ATS list displayed in the window.
  • Output A window displaying the selected ATS. Description:
  • This method allows the user to select an ATS for view only. No modifications or any other operations are allowed on this ATS. If the trader is not the owner of the ATS that was selected for view, the system can deny his request if the original creator of the ATS restricted the viewing permissions on the ATS. ATS permissions and ownerships are not covered by this patent. It is sufficient to say that the creator of an ATS has read and write permissions on the ATS. Other traders in the system have read only permission or no permission on the ATS.
  • Input User selects an ATS for edit from an ATS list displayed in the window.
  • Output A window displaying the selected A TS. Description:
  • This method allows the user to select an ATS for edit.
  • the trader has to be the owner of the ATS. He can change all editable values in the ATS such as items, quantities, price, objective function etc.
  • Input User selects an ATS for copy from an ATS list displayed in the window.
  • This method allows the user to select an ATS for view and create his own copy of the ATS. This allows the trader to use an existing ATS as a template for the creation ofa new ATS. The user becomes the owner of newly created ATS.
  • Input User selects an ATS for removal from an ATS list displayed in the window.
  • search criteria (trader name, quantity, item name, auction etc.).
  • This method allows the user to perform a search against the ATS's database using a variety of search criteria (e.g. trader name, quantity, item name, item property).
  • search criteria e.g. trader name, quantity, item name, item property.
  • One or more search criteria can be simultaneously entered and a Boolean combination of these criteria can be specified.
  • the filtering can be performed using the Match-Making Optimization method or traditional search paradigms. For example a trader can issue a search for all ATS's in the database that are mutually agreeable with all items in the current ATS, or mutually agreeable with specific items in the trader's current ATS.
  • the trader can specify traditional search criteria such as retrieving all ATS's that belong to a certain trader, or that belong to a trader from a specific geographical location. At the conclusion of this method the trader is presented with a list of ATS that answer his search criteria.
  • the trader can specify if he is searching against ATS's that are auctioned, bidding ATS's in an auction, or ATS's in the entire system.
  • This method allows the user to create a new auction in the database.
  • the trader that performs this auction is the auction initiator.
  • the ATS selected by the auction initiator is the ATS that is auctioned.
  • Input One ATS that will be submitted as a bid in one auction.
  • the first auction is Al .
  • A2 becomes the first auction, and so on. If an ATS bid is among the winners in the first auction, the items affected are updated by the system, and the remaining items in the
  • ATS participates expires, or all items in the ATS are exhausted.
  • Output The set of ATS's that belong to the trader that participate as bids in all active auctions in the system. Description:
  • An Auction State is defined as set of affected items in each bidding ATS that is among the projected winning bids, at a specific time within the life span of the auction.
  • a bidder in the auction can ask the system to display the Auction State at any time in the lifetime of the auction.
  • Input User inputs search criteria (trader name, quantity, item name etc.)
  • Output A set of active auctioned ATS's that meet these criteria Description:
  • This method allows the user to perform a search against the active auctioned ATS's in the database using a va ⁇ ety of search c ⁇ te ⁇ a (e.g. trader name, quantity, item name, item property)
  • search c ⁇ te ⁇ a e.g. trader name, quantity, item name, item property
  • One or more search c ⁇ te ⁇ a can be simultaneously entered and a Boolean combination of these c ⁇ te ⁇ a can be specified.
  • the filte ⁇ ng can be performed using the Match-Makmg Optimization method or traditional search paradigms. For example a trader can issue a search for all active auctioned ATS's in the database that are mutually agreeable with all items in the trader's ATS, or mutually agreeable with specific items m the trader's ATS.
  • the trader can specify traditional search c ⁇ te ⁇ a such as ret ⁇ evmg all ATS's that belong to a certain trader, or that belong to a trader from a specific geographical location.
  • search c ⁇ te ⁇ a such as ret ⁇ evmg all ATS's that belong to a certain trader, or that belong to a trader from a specific geographical location.
  • the trader is presented with a list of auctioned ATS's that answer his search c ⁇ tena.
  • Input Current auction.
  • Output Updated database, performed transaction.
  • the Match-Making Optimization method recommends specific transactions with the winning bidders.
  • the winning bidders are the ATS's that are mutually agreeable and optimize the objective of the auctioned ATS (e.g., minimal price, maximal profit etc.).
  • the initiating auction trader can decide which type of auction optimization he wants to perform:
  • One-To-One option 732 then perform One-To-One-MM-Optimization Method
  • One-To-K option 734 then perform One-To-One-MM-Optimization Method
  • One-To-All option 736 then perform One-To-One-MM-Optimization Method
  • Optimizing-ATS which is an ATS whose Objective will be used for optimization.
  • Optimizing-ATS which is an ATS whose Objective will be used for optimization.
  • Committed-ATS-Set which is a set of ATS's that are committed to perform a transaction if
  • Constraints ( ⁇ Optimizing-ATS ⁇ union Committed-ATS-Set) (including quantities of all item specifications) that achieves the optimal objective of the Optimizing-ATS.
  • Optimizing-ATS which is an ATS whose Objective will be used for optimization.

Landscapes

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

Abstract

L'invention concerne un marché électronique basé sur des spécifications commerciales adaptatives (ATS). Le système permet à des utilisateurs d'effectuer des transactions électroniques optimisées sur le Web. L'invention concerne un procédé et un système qui permettent à des commerçants d'établir des correspondances sur un marché électronique, en fonction des spécifications d'articles fournies par ces commerçants par l'intermédiaire de spécifications commerciales adaptatives. Une fois déterminé l'objectif d'un commerçant, le système lui recommande la transaction optimale, laquelle indique les articles et les quantités spécifiés par d'autres commerçants dans le cadre du marché électronique. L'invention concerne en outre des procédés d'échange fondés sur l'ATS, qui s'effectuent en général sur un marché électronique, et en particulier dans des galeries marchandes électroniques ou ventes aux enchères électroniques.
PCT/US2000/030323 1999-11-03 2000-11-03 Galerie marchande et vente aux encheres electroniques basees sur des specifications commerciales adaptatives WO2001033401A2 (fr)

Priority Applications (4)

Application Number Priority Date Filing Date Title
AU12485/01A AU1248501A (en) 1999-11-03 2000-11-03 Electronic malls and auctions based on adaptive trade specifications
CA002390216A CA2390216A1 (fr) 1999-11-03 2000-11-03 Galerie marchande et vente aux encheres electroniques basees sur des specifications commerciales adaptatives
EP00974055A EP1226537A2 (fr) 1999-11-03 2000-11-03 Galerie marchande et vente aux encheres electroniques basees sur des specifications commerciales adaptatives
IL14935000A IL149350A0 (en) 1999-11-03 2000-11-03 Electronic malls and auction based on adaptive trade specifications

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US16324599P 1999-11-03 1999-11-03
US60/163,245 1999-11-03
US70371200A 2000-11-02 2000-11-02
US09/703,712 2000-11-02

Publications (3)

Publication Number Publication Date
WO2001033401A2 true WO2001033401A2 (fr) 2001-05-10
WO2001033401A8 WO2001033401A8 (fr) 2002-04-11
WO2001033401A9 WO2001033401A9 (fr) 2002-08-15

Family

ID=26859476

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2000/030323 WO2001033401A2 (fr) 1999-11-03 2000-11-03 Galerie marchande et vente aux encheres electroniques basees sur des specifications commerciales adaptatives

Country Status (5)

Country Link
EP (1) EP1226537A2 (fr)
AU (1) AU1248501A (fr)
CA (1) CA2390216A1 (fr)
IL (1) IL149350A0 (fr)
WO (1) WO2001033401A2 (fr)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7370006B2 (en) 1999-10-27 2008-05-06 Ebay, Inc. Method and apparatus for listing goods for sale
US7499880B2 (en) 2002-09-25 2009-03-03 Combinenet, Inc. Dynamic exchange method and apparatus
US7523088B2 (en) 2004-03-31 2009-04-21 International Business Machines Corporation Method for increasing system resource availability in database management systems
US7577589B2 (en) 2002-09-25 2009-08-18 Combinenet, Inc. Method and apparatus for conducting a dynamic exchange
US7610236B2 (en) 2002-04-10 2009-10-27 Combinenet, Inc. Method and apparatus for forming expressive combinatorial auctions and exchanges
US8200687B2 (en) 2005-06-20 2012-06-12 Ebay Inc. System to generate related search queries
US8326697B2 (en) 1999-10-27 2012-12-04 Ebay Inc. Method and apparatus for facilitating sales of goods by independent parties
US9165300B2 (en) 2002-04-17 2015-10-20 Ebay Inc. Generating a recommendation
US10657585B2 (en) 2000-01-26 2020-05-19 Ebay Inc. On-line auction sales leads

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
No Search *

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7370006B2 (en) 1999-10-27 2008-05-06 Ebay, Inc. Method and apparatus for listing goods for sale
US8326697B2 (en) 1999-10-27 2012-12-04 Ebay Inc. Method and apparatus for facilitating sales of goods by independent parties
US10657585B2 (en) 2000-01-26 2020-05-19 Ebay Inc. On-line auction sales leads
US7610236B2 (en) 2002-04-10 2009-10-27 Combinenet, Inc. Method and apparatus for forming expressive combinatorial auctions and exchanges
US10074127B2 (en) 2002-04-17 2018-09-11 Ebay Inc. Generating a recommendation
US9165300B2 (en) 2002-04-17 2015-10-20 Ebay Inc. Generating a recommendation
US8195524B2 (en) 2002-09-25 2012-06-05 Combinenet, Inc. Items ratio based price/discount adjustment in a combinatorial auction
US8190489B2 (en) 2002-09-25 2012-05-29 Combinenet, Inc. Bid modification based on logical connections between trigger groups in a combinatorial exchange
US8190490B2 (en) 2002-09-25 2012-05-29 Combinenet, Inc. Overconstraint detection, rule relaxation and demand reduction in a combinatorial exchange
US8165921B1 (en) 2002-09-25 2012-04-24 Combinenet, Inc. Dynamic exchange method and apparatus
US7577589B2 (en) 2002-09-25 2009-08-18 Combinenet, Inc. Method and apparatus for conducting a dynamic exchange
US7499880B2 (en) 2002-09-25 2009-03-03 Combinenet, Inc. Dynamic exchange method and apparatus
US7523088B2 (en) 2004-03-31 2009-04-21 International Business Machines Corporation Method for increasing system resource availability in database management systems
US8200687B2 (en) 2005-06-20 2012-06-12 Ebay Inc. System to generate related search queries
US9183309B2 (en) 2005-06-20 2015-11-10 Paypal, Inc. System to generate related search queries
US9892156B2 (en) 2005-06-20 2018-02-13 Paypal, Inc. System to generate related search queries

Also Published As

Publication number Publication date
WO2001033401A9 (fr) 2002-08-15
EP1226537A2 (fr) 2002-07-31
WO2001033401A8 (fr) 2002-04-11
IL149350A0 (en) 2002-11-10
AU1248501A (en) 2001-05-14
CA2390216A1 (fr) 2001-05-10

Similar Documents

Publication Publication Date Title
US6751597B1 (en) System and method for adaptive trade specification and match-making optimization
US20030050861A1 (en) System and method for running a dynamic auction
US7146331B1 (en) Method and system for supplier prioritization
US6915275B2 (en) Managing customization of projects prior to manufacture in an electronic commerce system
US8095449B2 (en) Method and system for generating an auction using a product catalog in an integrated internal auction system
US7761341B2 (en) Medium, method, and system for automatic bidding across multiple auction sites
US20070143205A1 (en) Method and system for implementing configurable order options for integrated auction services on a seller's e-commerce site
US20020002579A1 (en) System and method for providing services using a Web hub
US6965877B2 (en) Brokering and facilitating consumer projects in an e-commerce system
US7835977B2 (en) Method and system for generating an auction using a template in an integrated internal auction system
US20070100739A1 (en) Method and system for implementing a target group for integrated auction services on a seller's e-commerce site
US20040006530A1 (en) Automated lotting
US7620575B1 (en) Locally generating price quotes using one or more pricing tools received from a seller
US20050131799A1 (en) Enhanced online auction method apparatus and system
US20070140222A1 (en) Facilitating the exchange of a position on a waiting list
WO2001033401A2 (fr) Galerie marchande et vente aux encheres electroniques basees sur des specifications commerciales adaptatives
WO2001031537A2 (fr) Systeme et procede pour des specifications commerciales adaptatives et une optimisation des correspondances
JP2010108342A (ja) 質屋運営方法、質屋運営システム、古物営業運営方法、古物営業運営システム及びプログラム
Yan et al. Toolkits for a distributed, agent-based web commerce system
US20030004857A1 (en) Coordinating manufacturing by local and remote manufacturers for a personalized design in an electronic commerce system
EP1226516A2 (fr) Procedes automatises destines a la creation de specifications de marche adaptatif
Goodwin et al. A decision-support system for quote generation
KR100487276B1 (ko) 온라인 쇼핑몰 중개 방법 및 온라인 쇼핑몰 중개 시스템
KR20050093466A (ko) 온라인 쇼핑몰 중개 방법 및 온라인 쇼핑몰 중개 시스템
US20070100741A1 (en) Method and system for viewing auction information in a seller's product catalog in an internal auction system

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

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 US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A2

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 TR 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 US 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 TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

D17 Declaration under article 17(2)a
WWE Wipo information: entry into national phase

Ref document number: 149350

Country of ref document: IL

WWE Wipo information: entry into national phase

Ref document number: 2390216

Country of ref document: CA

WWE Wipo information: entry into national phase

Ref document number: 2000974055

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 2000974055

Country of ref document: EP

COP Corrected version of pamphlet

Free format text: PAGES 1/11-11/11, DRAWINGS, REPLACED BY NEW PAGES 1/10-10/10; DUE TO LATE TRANSMITTAL BY THE RECEIVING OFFICE

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWW Wipo information: withdrawn in national office

Ref document number: 2000974055

Country of ref document: EP