CA2376674A1 - A facilitator for aggregating buyer power in an on-line market system - Google Patents
A facilitator for aggregating buyer power in an on-line market system Download PDFInfo
- Publication number
- CA2376674A1 CA2376674A1 CA002376674A CA2376674A CA2376674A1 CA 2376674 A1 CA2376674 A1 CA 2376674A1 CA 002376674 A CA002376674 A CA 002376674A CA 2376674 A CA2376674 A CA 2376674A CA 2376674 A1 CA2376674 A1 CA 2376674A1
- Authority
- CA
- Canada
- Prior art keywords
- seller
- buyer
- market system
- trading market
- line trading
- Prior art date
- Legal status (The legal status 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 status listed.)
- Abandoned
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
-
- 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
-
- 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/0601—Electronic shopping [e-shopping]
- G06Q30/0605—Supply or demand aggregation
-
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Development Economics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Technology Law (AREA)
- Entrepreneurship & Innovation (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The On-line Buyers Club System (OBCS) is a mechanism for the on-line purchasing of goods and services. The mechanism is targeted at user communities consisting of a large number of small-volume buyers (the "Buyers Club"). The primary function of the mechanism is to automatically aggregate the buying power of these buyers. The present invention provides a mechanism to promote competition among vendors (SELLERS) as well as a mechanism to influence buyers (BUYERS) to make a purchase.
Description
A FACILITATOR FOR AGGREGATING BUYER POWER
IN AN ON-LINE MARKET SYSTEM
PRIORITY
The present patent application claims priority to the corresponding provisional patent application serial no. 60/115,710, titled, "Online Buyers Club System", filed January 12, 1999.
FIELD OF THE INVENTION
The present invention relates to the use of networked computer systems for implementing an on-line trading market for the selling and purchase of goods and services BACKGROUND OF THE INVENTION
The Internet is profoundly changing business realities. One of these profound changes is the shift in power from seller to buyer. Increasingly, buyers, whether consumers or businesses, are made aware of alternative sources of goods and services, and are able to leverage this knowledge to command better buying terms. Online comparison shopping services, such as Junglee, Jango, and mySimon, are good illustrations of this reality. Because of the availability of these well-known comparison shopping services, other services have been made available for inviting buyers to quote prices. There are several conventional services, among the best known being Priceline.com, which allow buyers to quote prices and invite sellers to accept the quote. Indeed, Priceline has been granted a patent in connection with such activity (U.S. Patent No. 5,794,207).
A further edge is afforded to buyers by their ability to assemble into online communities of interest, and leverage this network to their commercial advantage. A straightforward way to leverage the community is through exchange of information. A more elaborate way to leverage the community is to aggregate the buying power of its members. There is already an implicit aggregation of buying power within communities. A service provider such as America Online is able to negotiate price discounts from vendors based on its very large subscriber base. The problem in such a situation is that the parties have no knowledge in advance of the actual buying volume; this limits the negotiating power of the service provider, and the willingness of the vendor to discount the price.
Thus, an apparatus is needed for facilitating the aggregation of buyer power in an on-line trading market system serving traders communicating via the Internet and similar networks.
SUMMARY OF THE INVENTION
The Online Buyers Club System (OBCS) is a mechanism for the online purchasing of goods and services. The mechanism is targeted at user communities consisting of a large number of small-volume buyers (the "Buyers Club"). The primary function of the mechanism is to automatically aggregate the buying power of these buyers. The present invention provides a mechanism to promote competition among vendors as well as a mechanism to incent buyers to make a purchase.
BRIEF DESCRIPTION OF THE DRAWINGS
Figure 1 is a system block diagram showing the components of the preferred embodiment.
IN AN ON-LINE MARKET SYSTEM
PRIORITY
The present patent application claims priority to the corresponding provisional patent application serial no. 60/115,710, titled, "Online Buyers Club System", filed January 12, 1999.
FIELD OF THE INVENTION
The present invention relates to the use of networked computer systems for implementing an on-line trading market for the selling and purchase of goods and services BACKGROUND OF THE INVENTION
The Internet is profoundly changing business realities. One of these profound changes is the shift in power from seller to buyer. Increasingly, buyers, whether consumers or businesses, are made aware of alternative sources of goods and services, and are able to leverage this knowledge to command better buying terms. Online comparison shopping services, such as Junglee, Jango, and mySimon, are good illustrations of this reality. Because of the availability of these well-known comparison shopping services, other services have been made available for inviting buyers to quote prices. There are several conventional services, among the best known being Priceline.com, which allow buyers to quote prices and invite sellers to accept the quote. Indeed, Priceline has been granted a patent in connection with such activity (U.S. Patent No. 5,794,207).
A further edge is afforded to buyers by their ability to assemble into online communities of interest, and leverage this network to their commercial advantage. A straightforward way to leverage the community is through exchange of information. A more elaborate way to leverage the community is to aggregate the buying power of its members. There is already an implicit aggregation of buying power within communities. A service provider such as America Online is able to negotiate price discounts from vendors based on its very large subscriber base. The problem in such a situation is that the parties have no knowledge in advance of the actual buying volume; this limits the negotiating power of the service provider, and the willingness of the vendor to discount the price.
Thus, an apparatus is needed for facilitating the aggregation of buyer power in an on-line trading market system serving traders communicating via the Internet and similar networks.
SUMMARY OF THE INVENTION
The Online Buyers Club System (OBCS) is a mechanism for the online purchasing of goods and services. The mechanism is targeted at user communities consisting of a large number of small-volume buyers (the "Buyers Club"). The primary function of the mechanism is to automatically aggregate the buying power of these buyers. The present invention provides a mechanism to promote competition among vendors as well as a mechanism to incent buyers to make a purchase.
BRIEF DESCRIPTION OF THE DRAWINGS
Figure 1 is a system block diagram showing the components of the preferred embodiment.
Figures 2-5, 6A, 6B, 7, 8A, 8B, and 9-12 illustrate a tree-structured menu of choices for setting up a sale in the Buyers Club system.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
The present invention is a method and apparatus for facilitating the aggregation of buyer power in an on-line trading market system serving traders communicating via the Internet and similar networks. In the following detailed description, the present invention is sometimes referred to as the On-Line Buyers Club System (OBCS). Further, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be evident, however, to one of ordinary skill in the art that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present invention.
Referring to Figure 1, the present invention includes the following primary components: 1) an on-line facilitator (referred to herein as the Buyers Club Facilitator or BCF) comprising computer and software connectable with an information network for communication with a plurality of sellers and buyers, 2) a set of sellers having goods and/or services for sale or lease to buyers, and 3) a set of buyers (referred to herein as the Buyers Club) desiring to purchase or lease a type of goods and/or services. In the present invention, the sales/purchase transaction typically occurs via the information network. Thus, proximity is not a barrier in the present system. Further, the sellers in the present system do not need to have quantified pricing for their goods and services prior to using the present invention. Other features and benefits of the present invention are set forth below.
The benefits The particular benefits of the mechanism to the buyers and sellers are as follows:
~ To Buyers Club members:
~ The primary benefit is lower prices, commensurate with those that a single large-volume buyer could expect.
~ A secondary value, which is manifested in some versions of the mechanism, is the ability to gauge the interest in particular items by fellow club members, update one's own value for that item, and make buying decisions based in part on this updated assessment.
~ To seller or sellers to the Buyers Club:
~ The primary value, beside the opportunity to sell to a large set of potential buyers, is to enjoy a pricing scheme that automatically adapts to the selling volume, from single-unit sales to arbitrarily high volumes.
~ A secondary value is allowing the seller to dynamically adapt prices to demand revealed by the market during the sale process, and, in some versions of the mechanism, to competitors' prices.
The mechanism in a nutshell Referring again to Figure 1, the OBCS is used by a Buyers Club facilitator, hereafter BCF, to initiate "buying sessions" (in a typical application this BCF is an online service provider). In the most basic type of buying session a single seller, SellCo, is invited by a particular BCF, OnlineCo, to sell a particular good to its members.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
The present invention is a method and apparatus for facilitating the aggregation of buyer power in an on-line trading market system serving traders communicating via the Internet and similar networks. In the following detailed description, the present invention is sometimes referred to as the On-Line Buyers Club System (OBCS). Further, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be evident, however, to one of ordinary skill in the art that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present invention.
Referring to Figure 1, the present invention includes the following primary components: 1) an on-line facilitator (referred to herein as the Buyers Club Facilitator or BCF) comprising computer and software connectable with an information network for communication with a plurality of sellers and buyers, 2) a set of sellers having goods and/or services for sale or lease to buyers, and 3) a set of buyers (referred to herein as the Buyers Club) desiring to purchase or lease a type of goods and/or services. In the present invention, the sales/purchase transaction typically occurs via the information network. Thus, proximity is not a barrier in the present system. Further, the sellers in the present system do not need to have quantified pricing for their goods and services prior to using the present invention. Other features and benefits of the present invention are set forth below.
The benefits The particular benefits of the mechanism to the buyers and sellers are as follows:
~ To Buyers Club members:
~ The primary benefit is lower prices, commensurate with those that a single large-volume buyer could expect.
~ A secondary value, which is manifested in some versions of the mechanism, is the ability to gauge the interest in particular items by fellow club members, update one's own value for that item, and make buying decisions based in part on this updated assessment.
~ To seller or sellers to the Buyers Club:
~ The primary value, beside the opportunity to sell to a large set of potential buyers, is to enjoy a pricing scheme that automatically adapts to the selling volume, from single-unit sales to arbitrarily high volumes.
~ A secondary value is allowing the seller to dynamically adapt prices to demand revealed by the market during the sale process, and, in some versions of the mechanism, to competitors' prices.
The mechanism in a nutshell Referring again to Figure 1, the OBCS is used by a Buyers Club facilitator, hereafter BCF, to initiate "buying sessions" (in a typical application this BCF is an online service provider). In the most basic type of buying session a single seller, SellCo, is invited by a particular BCF, OnlineCo, to sell a particular good to its members.
SellCo submits a function describing how low a price it is willing to offer, depending on the number of buyers willing to buy. This function is called a schedule, and may or may not be disclosed in advance to the buyers. Buyers then submit maximum prices at which they would buy. The system would find the largest quantity (and smallest price) at which a deal can be made, possibly as buyer bids are coming in. The sellers) then sell the goods to all buyers who offered more than the discovered price.
In addition, SellCo may disclose the prices at which it is willing to sell, as a way of attracting interest. After an initial phase, the market would publish to buyer the additional quantity of buyers needed to achieve each price point.
The disclosure of potential prices may get bids from people who are scared by the low quantity price. In addition, the knowledge that the price will drop with a few more bids gives buyers a reason to evangelize or raise their own bids to get in on the deal.
SellCo may also wish to have its prices depend on other factors, such as the rate at which buy offers are coming in. In this case, SellCo may be able to change its schedule. An automated means of doing this is called an automated strategy. Note that the special case of a fixed price schedule with a complicated automated strategy is the same as permitting the schedule to depend on more factors than just quantity.
This basic type of buying session is extended in a large number of ways.
Some are straightforward - for example, a buyer can offer to buy more than one unit. Others are more complex. For example, if there is only a single seller for a kind of good as in the basic version, or alternatively a small, select set of sellers, the system offers several auction-based schemes for selecting these seller(s).
Or, as another example, when multiple sellers are invited to sell competing products simultaneously, the system specifies several alternative conditions under which buyers who have committed to one seller are permitted to switch to another seller.
These and other considerations give rise to multiple versions of buying sessions, which are laid out systematically in the next sections.
The mechanism in detail - narrative description Here we give a narrative description of the important choices faced by OnlineCo in setting up a buying session within the OBCS, including illustrative examples of considerations that impact these choices. In the next section we give the precise menu of choices.
In setting up a buying session the Buyers Club facilitator is required to make choices in the following areas:
1. What goods will be offered for trade 2. Which vendors will be qualified to, and actually, offer the goods for sale 3. How the system determines the best price and quantity 4. What are the rights and obligations of vendors in making sell offers 5. What are the rights and obligations of buyers in making buy offers 6. What information is revealed to buyers and sellers throughout the buying session 7. How the system closes a buying session What goods will be offered for sale:
Necessity of Moderation Which goods will be offered will necessarily be in some sense a choice of the BCF. At a minimum, there is a need for moderation to avoid misuse.
Possibility of Automation Ideally, the involvement of the BCF could be kept to a minimum, particularly in the area of choosing which goods. This requires automatically gauging interest from buyers and sellers. Inputs to this decision process could be self nomination by vendors or requests by buyers for classes of goods. These requests (by buyers or sellers) could be published to the potential buyers along with a vote gathering mechanism. Goods which gather a large number of votes and have willing sellers would then have a buying session.
Which vendors will offer the og ods:
Number of Sellers The first choice is the number of sellers admitted to the buying session.
This choice must be made both for the number of sellers to initially consider, and the number of sellers to present directly to the buyers. Inviting multiple sellers offers clear advantages for the buyer, both in terms of diversity of products offered and competition to drive down prices. Multiple sellers also results in a somewhat more complicated (and difficult to design) buying session, since rules need to be set up for when buyers may switch sellers and similar issues. Most of these issues exist even with a single seller, who has multiple products in the buying session. (In implementation, multiple goods from a single seller and multiple sellers offering multiple goods will likely look exactly the same internally.) The other option is to have only a single seller in the buying session. This seller would submit a binding schedule for how low a price s/he would offer for various quantities of goods.
Determining Which Sellers) Whether there is one seller or many, there is a need to pick which one(s).
In the multiple sellers case admission could simply be open. For non-open buying sessions, sellers could be determined by accepting the sellers with the best price schedules, sellers with unusually heavily desired products, or sellers who pay the most to the BCF. The first two require the BCF to make assessments of products and price schedules, but seem fairer. The third is easy to decide and generates revenue for the BCF. For the first and third options, any of several auction mechanisms could be used to determine who has the best schedule or best payment to the BCF.
How the stem determines the best price and quantity As the PBCS collects bid from buyers, it must determine how many goods are sold at which price. For the single seller with a monotonic schedule, this is simple. The system simply chooses the highest quantity (and associated schedule price) such that there are enough willing buyers to receive the quantity at that price.
If a buyer is unwilling to submit prices (and credit card numbers) without knowing that s/he will receive the goods, the buyer may wait until enough other buyers bid to lower the price to an agreeable level. If all buyers do this, either by individual decision or by OBCS design, the system becomes one of a pure declining posted price. As each buyer sees the price drop below his/her threshold, s/he will submit a bid for the good, possibly further lowering the posted price.
This declining posted price feature is shared with the original exposition, with the key difference being that the original description allows the OBCS to accept and member potential buyers who are willing to buy only if the price drops further. In addition, the OBCS can recognize when enough potential buyers exist to force the price down purely on the volume of the potential buyers.
For multiple sellers, there is not necessarily a unique highest quantity. (Is a sale of 300 Fords and 7 Cadillacs as good as a sale of 100 Fords and 150 Cadillacs?) If the buyers are required to submit a bid on only on a good, there is no difficulty - the maximum quantity of Fords is independent of the maximum quantity of Cadillacs, and both are determined as before.
If a buyer can submit a bid that is for either X or Y depending on price, the situation gets complicated. Essentially, bidders get put into either the queue expected to buy X or the queue expected to buy Y. As the relative prices change, bidders move from one queue to the other. This is called "Switching Goods".
This is the same for the original mechanism or for the pure declining posted price mechanism. The quantities and prices of the sale are determined by the quantities in each queue at the end of the auction. (See Switching Goods and Final Quantity Schedules.) What are the rights and obligations of vendors in setting prices:
Seller Schedules The underlying concept of the OBCS is to aggregate buying power to negotiate a volume discount. The immediate problem, solved by the OBCS, is that the actual volume is not known until after the buying session. This problem is solved by allowing a seller to submit a schedule to describe how far s/he is willing to drop his price in return for higher volume. This allows a seller to offer volume discounts without knowing in advance exactly what the volume will be.
More generally, a seller's schedule, combined with his automated strategy, is whatever function determines the seller's price. This function could depend on the quantity committed to that seller or others, the particular products and options involved, the prices of competitors, and/or a new schedule submitted for other reasons.
As a function of quantity, the seller's price will generally decrease.
(though this may not be required by all OBCS. If sellers can raise prices during and auction, then other options in the auction design are restricted. And conversely. See Price Non-Monotonicity.) This leaves open which quantity is meant. Quantity could mean the total volume of sales in the buying session, the volume of sales for that vendor, or the volume of sales for the vendor's competitors. The BCF needs to determine which of these to support (possibly all).
Within each of these, there is the problem that the final quantity is not yet known. If sales volume increases as more buyers come in, and if price schedules are monotonically decreasing, this is not a problem. The price goes down, so every buyer gets at least as good a deal as s/he was promised, and the seller gets to sell a large volume at a price s/he declared. However, if the volume goes down, either by withdrawals of bids or buyers switching to other sellers' goods, then the price given by the schedule could be higher than the price quoted.
(In practice, withdrawals will likely be forbidden, and other restrictions imposed to address this issue. See Switching Goods and Final Quantity Schedules.) Seller Schedules for Multiple Products Schedules for multiple products and options from the same seller are straightforward, but should include some way for the seller to lower the prices on his overall product line in concert, to keep relative incentives in order.
This could be done by keeping separate schedules, fixing the absolute price differences among products, or fixing the price ratios between products.
Schedule dependencies on competitors prices Lowering price due to a lowering of competitors price is clear.
Submission of New Schedules Sellers may wish to submit a new schedule entirely. Since committed buyers and current shoppers expect that they will be able to make purchases based on the quoted price, sellers should not be able to submit arbitrary new schedules effective immediately and retroactively. One option is to require that the new schedule offer better deals than the old. Better could mean all price points are as low or lower (not all equal) or that overall it looks like a better deal.
(The "better overall" option is fuzzy and probably unworkable.) Another is to delay the new schedule by an hour and let everyone committed under the old schedule keep their deals.
What are the nits and obligation of buyers in making offers:
Grant Early Buyers Late Prices In order to encourage potential buyers to bid early, everyone can be granted the price based on the total volume in the buying session. (As noted before, there exist multiple meaningful interpretations of "volume".) That way, each bidder knows that s/he can do no better by waiting, and should bid whenever the price is acceptable. S/he is guaranteed the best price on that product in that buying session.
Withdrawals The buyer may decide s/he wishes s/he had not submitted his bid, and wish to withdraw it. While this option reduces the risk for buyers, it also undermines the credibility of the market, since sellers are asked to offer volume discounts without any real commitment from buyers. If buyer commitments are perceived as flaky, sellers may not be willing to seriously participate in the presence of easy withdrawals. One possibility is to charge a fee for withdrawing a bid. Another approach, likely to be more common in practice, is to simply not allow withdrawals.
Switching Goods If multiple vendors or products are offered, it is likely that a buyer who bid on item A may later see a better price on item B. If buyers are not allowed to switch to better offers, there is again a disincentive for buyers to bid early, with the same problems as before. Permitting the buyer to choose the newly lower priced good is here called allowing "Switching Goods". The goods may or may not be provided by different venders.
In extreme situations, arbitrary switching of goods without penalty is the same as withdrawal, since a buyer could exchange his/her high value bid with an extremely low value bid. However, in a typical case the BCF will need to group goods for ease of use anyway, this is avoided by only allowing switching goods within the stated group.
Another way to control switching goods and withdrawals is the charge a fee for each. This is still a cost imposed on those who commit early, and thus again discourages bidding, so users of the system are advised to use this feature with caution.
Given that switching goods is permitted, there are different ways for a customer to specify when s/he is willing to switch goods. The buyer might have to watch the market and make decisions by submitting a new (replacement) bid.
Another alternative is to allow the buyer to submit the equivalent of a schedule:
"buy product A unless product B is 40 dollars less. In that case, buy product B".
when buyers submit schedules, replacing the schedule should require that the new schedule also result in the same number of purchases. (If the buyer were permitted to replace her/his schedule with an arbitrary schedule, s/he could effectively withdraw her/his bid by offering to pay only an extremely low bid.) Limit Orders Limit orders are bids that are contingent on a price which may not yet have been achieved. For example: "Buy product A if the price drops below $300." In the original mechanism, all bids are thought of as limit orders. In the pure declining posted price mechanism, limit orders are an optional extension.
Limit orders may also include goods switching rules: "Buy product A if the price on A is below $300, or B if the price on B is below $400. If both are satisfied, buy A if its price is no more than 75% of the price on B, else buy B."
Limit Orders could also have time expirations.
Switching Goods and Final Quantity Schedules If a seller's price schedule depends on the final quantity s/he sells, and buyers are able to decommit themselves from that seller, posted prices are less meaningful. The reason is that early bidders could switch to another seller's goods, and by doing so lower the final number committed and thus raise the price. The new price is above the price offered to late bidders, who may be unwilling to pay the extra. Ways to solve this include:
Require the seller to honor his old prices to those who were committed.
Don't allow sellers to raise prices as quantities fall. (think of prices as ratcheted.) Permit buyers to withdraw for free if seller raises prices above initial commitment level. (If limit orders are permitted, the buy bid could automatically become a limit order.) The first two require some level of controls to prevent abuse of the OBCS.
Vendor A might submit a huge order to vendor B, in order to drive B's price down.
Then Vendor A could switch that order to itself. However, if buyers (or sellers) are paying a small fee per cleared unit bid, such tactics are probably too expensive to contemplate.
Price Non-Motonicity Depending on the rules of the OBCS, price schedules may or may not be monotonically decreasing. (The seller may want to raise his price is he gets too many bids, for example.) This requires the auction to determine what to do with buy offers submitted at a time when the price was lower, similar to the discussion immediately above.
In addition, there is a linking of seller flexibility and strength of commitment to buyers. If the seller has freedom to raise his prices and invalidate old offers, then buyers do not have the assurance of a strong commitment. The ability to raise prices arbitrarily also implies the ability for sellers to withdraw.
Seller withdrawal or price raising could reduce buyer confidence in the OBCS
in the same way that buyer withdrawal can reduce seller confidence.
What information is revealed to buyers and sellers throughout the buying session:
Information on Quality of Goods Buyers will want to know what they are buying so the market should include product reviews and descriptions and prices. In addition, information could be given on which products are selling well in the current buying session, as a way of letting buyers know what other buyers think of the goods.
Information on Prices In order to make any purchasing decision buyers must know the current price of goods. Since this information is thus public, the price list should be made directly available to sellers as well.
Information on Potential Prices The seller's schedule, without quantities, is a list of potential prices which could attract buyers. In addition, the number of buyers needed to achieve further price decreases could be released. The potential price drop gives buyers an incentive to evangelize or raise their bids, as mentioned earlier.
Buyer to Buyer Communication Buyers could send messages to each other. If buyers are also aware of the number of bidders needed to further lower the price, then this could be a way for buyers to cajole each other to lower their bids in concert.
Information on Schedules Optionally, information on each seller's complete price schedule could be made available to buyers and/or sellers. For buyers, this is likely to be too much information to be useful. Sellers may also wish for there schedules to be kept in some measure of confidence for strategic reasons.
Information on buyer preferences Aggregate information on which prices buyers are willing to pay could be released while the DOBCS runs. It could also be released only after the system closes, or not at all.
Methods of Information dispersal In addition to the obvious queries, large changes to prices and current purchase quantity could be broadcast to participants through push technology.
How the system closes a buying session Multiple rounds and termination conditions The DOBCS could go through multiple rounds of bid acceptance and price discovery, possibly discovering the price after every buyer bid. These would have to end eventually, either because a set time had elapsed, the system had received few new bids recently, or the seller's supply had been exhausted.
Excess demand.
It is possible that the seller has a limited quantity of goods for sale and that there are enough buyers to more than exhaust that quantity. In this case, the DOBCS reaction must be specified.
The DOBCS could just stop receiving buy bids when it realizes that is has willing buyers for all available goods. Any buyers in the process of submitting a bid would be out of luck. If the system reserved a percentage of the goods and shut down when it had sold all but the reserve, then those buyers already submitting bids could still get their orders filled. The remainder of the reserves could then be distributed by auction or by lottery. A final way to deal with excess supply is for the late bids to take delayed delivery. This would need to be combined with one of the first mechanisms to cover the unusual cases where the seller cannot supply all of the demand even with an extended schedule.
The mechanism in detail - a menu tree Figures 2-12 illustrate a tree-structured menu of choices for setting up a sale in the Buyers Club system.
Thus, a method and apparatus for facilitating the aggregation of buyer power in an on-line trading market system serving traders communicating via the Internet and similar networks is disclosed. Although the present invention has been described with reference to specific exemplary embodiments, it will be apparent to those of ordinary skill in the art that various modifications and augmentations may be made to these embodiments without departing from the broader spirit and scope of the present invention as set forth in the following claims.
In addition, SellCo may disclose the prices at which it is willing to sell, as a way of attracting interest. After an initial phase, the market would publish to buyer the additional quantity of buyers needed to achieve each price point.
The disclosure of potential prices may get bids from people who are scared by the low quantity price. In addition, the knowledge that the price will drop with a few more bids gives buyers a reason to evangelize or raise their own bids to get in on the deal.
SellCo may also wish to have its prices depend on other factors, such as the rate at which buy offers are coming in. In this case, SellCo may be able to change its schedule. An automated means of doing this is called an automated strategy. Note that the special case of a fixed price schedule with a complicated automated strategy is the same as permitting the schedule to depend on more factors than just quantity.
This basic type of buying session is extended in a large number of ways.
Some are straightforward - for example, a buyer can offer to buy more than one unit. Others are more complex. For example, if there is only a single seller for a kind of good as in the basic version, or alternatively a small, select set of sellers, the system offers several auction-based schemes for selecting these seller(s).
Or, as another example, when multiple sellers are invited to sell competing products simultaneously, the system specifies several alternative conditions under which buyers who have committed to one seller are permitted to switch to another seller.
These and other considerations give rise to multiple versions of buying sessions, which are laid out systematically in the next sections.
The mechanism in detail - narrative description Here we give a narrative description of the important choices faced by OnlineCo in setting up a buying session within the OBCS, including illustrative examples of considerations that impact these choices. In the next section we give the precise menu of choices.
In setting up a buying session the Buyers Club facilitator is required to make choices in the following areas:
1. What goods will be offered for trade 2. Which vendors will be qualified to, and actually, offer the goods for sale 3. How the system determines the best price and quantity 4. What are the rights and obligations of vendors in making sell offers 5. What are the rights and obligations of buyers in making buy offers 6. What information is revealed to buyers and sellers throughout the buying session 7. How the system closes a buying session What goods will be offered for sale:
Necessity of Moderation Which goods will be offered will necessarily be in some sense a choice of the BCF. At a minimum, there is a need for moderation to avoid misuse.
Possibility of Automation Ideally, the involvement of the BCF could be kept to a minimum, particularly in the area of choosing which goods. This requires automatically gauging interest from buyers and sellers. Inputs to this decision process could be self nomination by vendors or requests by buyers for classes of goods. These requests (by buyers or sellers) could be published to the potential buyers along with a vote gathering mechanism. Goods which gather a large number of votes and have willing sellers would then have a buying session.
Which vendors will offer the og ods:
Number of Sellers The first choice is the number of sellers admitted to the buying session.
This choice must be made both for the number of sellers to initially consider, and the number of sellers to present directly to the buyers. Inviting multiple sellers offers clear advantages for the buyer, both in terms of diversity of products offered and competition to drive down prices. Multiple sellers also results in a somewhat more complicated (and difficult to design) buying session, since rules need to be set up for when buyers may switch sellers and similar issues. Most of these issues exist even with a single seller, who has multiple products in the buying session. (In implementation, multiple goods from a single seller and multiple sellers offering multiple goods will likely look exactly the same internally.) The other option is to have only a single seller in the buying session. This seller would submit a binding schedule for how low a price s/he would offer for various quantities of goods.
Determining Which Sellers) Whether there is one seller or many, there is a need to pick which one(s).
In the multiple sellers case admission could simply be open. For non-open buying sessions, sellers could be determined by accepting the sellers with the best price schedules, sellers with unusually heavily desired products, or sellers who pay the most to the BCF. The first two require the BCF to make assessments of products and price schedules, but seem fairer. The third is easy to decide and generates revenue for the BCF. For the first and third options, any of several auction mechanisms could be used to determine who has the best schedule or best payment to the BCF.
How the stem determines the best price and quantity As the PBCS collects bid from buyers, it must determine how many goods are sold at which price. For the single seller with a monotonic schedule, this is simple. The system simply chooses the highest quantity (and associated schedule price) such that there are enough willing buyers to receive the quantity at that price.
If a buyer is unwilling to submit prices (and credit card numbers) without knowing that s/he will receive the goods, the buyer may wait until enough other buyers bid to lower the price to an agreeable level. If all buyers do this, either by individual decision or by OBCS design, the system becomes one of a pure declining posted price. As each buyer sees the price drop below his/her threshold, s/he will submit a bid for the good, possibly further lowering the posted price.
This declining posted price feature is shared with the original exposition, with the key difference being that the original description allows the OBCS to accept and member potential buyers who are willing to buy only if the price drops further. In addition, the OBCS can recognize when enough potential buyers exist to force the price down purely on the volume of the potential buyers.
For multiple sellers, there is not necessarily a unique highest quantity. (Is a sale of 300 Fords and 7 Cadillacs as good as a sale of 100 Fords and 150 Cadillacs?) If the buyers are required to submit a bid on only on a good, there is no difficulty - the maximum quantity of Fords is independent of the maximum quantity of Cadillacs, and both are determined as before.
If a buyer can submit a bid that is for either X or Y depending on price, the situation gets complicated. Essentially, bidders get put into either the queue expected to buy X or the queue expected to buy Y. As the relative prices change, bidders move from one queue to the other. This is called "Switching Goods".
This is the same for the original mechanism or for the pure declining posted price mechanism. The quantities and prices of the sale are determined by the quantities in each queue at the end of the auction. (See Switching Goods and Final Quantity Schedules.) What are the rights and obligations of vendors in setting prices:
Seller Schedules The underlying concept of the OBCS is to aggregate buying power to negotiate a volume discount. The immediate problem, solved by the OBCS, is that the actual volume is not known until after the buying session. This problem is solved by allowing a seller to submit a schedule to describe how far s/he is willing to drop his price in return for higher volume. This allows a seller to offer volume discounts without knowing in advance exactly what the volume will be.
More generally, a seller's schedule, combined with his automated strategy, is whatever function determines the seller's price. This function could depend on the quantity committed to that seller or others, the particular products and options involved, the prices of competitors, and/or a new schedule submitted for other reasons.
As a function of quantity, the seller's price will generally decrease.
(though this may not be required by all OBCS. If sellers can raise prices during and auction, then other options in the auction design are restricted. And conversely. See Price Non-Monotonicity.) This leaves open which quantity is meant. Quantity could mean the total volume of sales in the buying session, the volume of sales for that vendor, or the volume of sales for the vendor's competitors. The BCF needs to determine which of these to support (possibly all).
Within each of these, there is the problem that the final quantity is not yet known. If sales volume increases as more buyers come in, and if price schedules are monotonically decreasing, this is not a problem. The price goes down, so every buyer gets at least as good a deal as s/he was promised, and the seller gets to sell a large volume at a price s/he declared. However, if the volume goes down, either by withdrawals of bids or buyers switching to other sellers' goods, then the price given by the schedule could be higher than the price quoted.
(In practice, withdrawals will likely be forbidden, and other restrictions imposed to address this issue. See Switching Goods and Final Quantity Schedules.) Seller Schedules for Multiple Products Schedules for multiple products and options from the same seller are straightforward, but should include some way for the seller to lower the prices on his overall product line in concert, to keep relative incentives in order.
This could be done by keeping separate schedules, fixing the absolute price differences among products, or fixing the price ratios between products.
Schedule dependencies on competitors prices Lowering price due to a lowering of competitors price is clear.
Submission of New Schedules Sellers may wish to submit a new schedule entirely. Since committed buyers and current shoppers expect that they will be able to make purchases based on the quoted price, sellers should not be able to submit arbitrary new schedules effective immediately and retroactively. One option is to require that the new schedule offer better deals than the old. Better could mean all price points are as low or lower (not all equal) or that overall it looks like a better deal.
(The "better overall" option is fuzzy and probably unworkable.) Another is to delay the new schedule by an hour and let everyone committed under the old schedule keep their deals.
What are the nits and obligation of buyers in making offers:
Grant Early Buyers Late Prices In order to encourage potential buyers to bid early, everyone can be granted the price based on the total volume in the buying session. (As noted before, there exist multiple meaningful interpretations of "volume".) That way, each bidder knows that s/he can do no better by waiting, and should bid whenever the price is acceptable. S/he is guaranteed the best price on that product in that buying session.
Withdrawals The buyer may decide s/he wishes s/he had not submitted his bid, and wish to withdraw it. While this option reduces the risk for buyers, it also undermines the credibility of the market, since sellers are asked to offer volume discounts without any real commitment from buyers. If buyer commitments are perceived as flaky, sellers may not be willing to seriously participate in the presence of easy withdrawals. One possibility is to charge a fee for withdrawing a bid. Another approach, likely to be more common in practice, is to simply not allow withdrawals.
Switching Goods If multiple vendors or products are offered, it is likely that a buyer who bid on item A may later see a better price on item B. If buyers are not allowed to switch to better offers, there is again a disincentive for buyers to bid early, with the same problems as before. Permitting the buyer to choose the newly lower priced good is here called allowing "Switching Goods". The goods may or may not be provided by different venders.
In extreme situations, arbitrary switching of goods without penalty is the same as withdrawal, since a buyer could exchange his/her high value bid with an extremely low value bid. However, in a typical case the BCF will need to group goods for ease of use anyway, this is avoided by only allowing switching goods within the stated group.
Another way to control switching goods and withdrawals is the charge a fee for each. This is still a cost imposed on those who commit early, and thus again discourages bidding, so users of the system are advised to use this feature with caution.
Given that switching goods is permitted, there are different ways for a customer to specify when s/he is willing to switch goods. The buyer might have to watch the market and make decisions by submitting a new (replacement) bid.
Another alternative is to allow the buyer to submit the equivalent of a schedule:
"buy product A unless product B is 40 dollars less. In that case, buy product B".
when buyers submit schedules, replacing the schedule should require that the new schedule also result in the same number of purchases. (If the buyer were permitted to replace her/his schedule with an arbitrary schedule, s/he could effectively withdraw her/his bid by offering to pay only an extremely low bid.) Limit Orders Limit orders are bids that are contingent on a price which may not yet have been achieved. For example: "Buy product A if the price drops below $300." In the original mechanism, all bids are thought of as limit orders. In the pure declining posted price mechanism, limit orders are an optional extension.
Limit orders may also include goods switching rules: "Buy product A if the price on A is below $300, or B if the price on B is below $400. If both are satisfied, buy A if its price is no more than 75% of the price on B, else buy B."
Limit Orders could also have time expirations.
Switching Goods and Final Quantity Schedules If a seller's price schedule depends on the final quantity s/he sells, and buyers are able to decommit themselves from that seller, posted prices are less meaningful. The reason is that early bidders could switch to another seller's goods, and by doing so lower the final number committed and thus raise the price. The new price is above the price offered to late bidders, who may be unwilling to pay the extra. Ways to solve this include:
Require the seller to honor his old prices to those who were committed.
Don't allow sellers to raise prices as quantities fall. (think of prices as ratcheted.) Permit buyers to withdraw for free if seller raises prices above initial commitment level. (If limit orders are permitted, the buy bid could automatically become a limit order.) The first two require some level of controls to prevent abuse of the OBCS.
Vendor A might submit a huge order to vendor B, in order to drive B's price down.
Then Vendor A could switch that order to itself. However, if buyers (or sellers) are paying a small fee per cleared unit bid, such tactics are probably too expensive to contemplate.
Price Non-Motonicity Depending on the rules of the OBCS, price schedules may or may not be monotonically decreasing. (The seller may want to raise his price is he gets too many bids, for example.) This requires the auction to determine what to do with buy offers submitted at a time when the price was lower, similar to the discussion immediately above.
In addition, there is a linking of seller flexibility and strength of commitment to buyers. If the seller has freedom to raise his prices and invalidate old offers, then buyers do not have the assurance of a strong commitment. The ability to raise prices arbitrarily also implies the ability for sellers to withdraw.
Seller withdrawal or price raising could reduce buyer confidence in the OBCS
in the same way that buyer withdrawal can reduce seller confidence.
What information is revealed to buyers and sellers throughout the buying session:
Information on Quality of Goods Buyers will want to know what they are buying so the market should include product reviews and descriptions and prices. In addition, information could be given on which products are selling well in the current buying session, as a way of letting buyers know what other buyers think of the goods.
Information on Prices In order to make any purchasing decision buyers must know the current price of goods. Since this information is thus public, the price list should be made directly available to sellers as well.
Information on Potential Prices The seller's schedule, without quantities, is a list of potential prices which could attract buyers. In addition, the number of buyers needed to achieve further price decreases could be released. The potential price drop gives buyers an incentive to evangelize or raise their bids, as mentioned earlier.
Buyer to Buyer Communication Buyers could send messages to each other. If buyers are also aware of the number of bidders needed to further lower the price, then this could be a way for buyers to cajole each other to lower their bids in concert.
Information on Schedules Optionally, information on each seller's complete price schedule could be made available to buyers and/or sellers. For buyers, this is likely to be too much information to be useful. Sellers may also wish for there schedules to be kept in some measure of confidence for strategic reasons.
Information on buyer preferences Aggregate information on which prices buyers are willing to pay could be released while the DOBCS runs. It could also be released only after the system closes, or not at all.
Methods of Information dispersal In addition to the obvious queries, large changes to prices and current purchase quantity could be broadcast to participants through push technology.
How the system closes a buying session Multiple rounds and termination conditions The DOBCS could go through multiple rounds of bid acceptance and price discovery, possibly discovering the price after every buyer bid. These would have to end eventually, either because a set time had elapsed, the system had received few new bids recently, or the seller's supply had been exhausted.
Excess demand.
It is possible that the seller has a limited quantity of goods for sale and that there are enough buyers to more than exhaust that quantity. In this case, the DOBCS reaction must be specified.
The DOBCS could just stop receiving buy bids when it realizes that is has willing buyers for all available goods. Any buyers in the process of submitting a bid would be out of luck. If the system reserved a percentage of the goods and shut down when it had sold all but the reserve, then those buyers already submitting bids could still get their orders filled. The remainder of the reserves could then be distributed by auction or by lottery. A final way to deal with excess supply is for the late bids to take delayed delivery. This would need to be combined with one of the first mechanisms to cover the unusual cases where the seller cannot supply all of the demand even with an extended schedule.
The mechanism in detail - a menu tree Figures 2-12 illustrate a tree-structured menu of choices for setting up a sale in the Buyers Club system.
Thus, a method and apparatus for facilitating the aggregation of buyer power in an on-line trading market system serving traders communicating via the Internet and similar networks is disclosed. Although the present invention has been described with reference to specific exemplary embodiments, it will be apparent to those of ordinary skill in the art that various modifications and augmentations may be made to these embodiments without departing from the broader spirit and scope of the present invention as set forth in the following claims.
Claims (43)
1. An on-line trading market system comprising:
a seller interface for receiving a pricing schedule from one or more sellers via a network;
a buyer interface for receiving a set of purchase specifications from a plurality of buyers via the network; and a facilitator coupled with said seller interface and said buyer interface and configured to aggregate the set of purchase specifications from said plurality of buyers to form an aggregated buyer purchase specification and to determine a best fit transaction based on the seller pricing schedule and the aggregated buyer purchase specification.
a seller interface for receiving a pricing schedule from one or more sellers via a network;
a buyer interface for receiving a set of purchase specifications from a plurality of buyers via the network; and a facilitator coupled with said seller interface and said buyer interface and configured to aggregate the set of purchase specifications from said plurality of buyers to form an aggregated buyer purchase specification and to determine a best fit transaction based on the seller pricing schedule and the aggregated buyer purchase specification.
2. The on-line trading market system as claimed in claim 1, wherein the best fit transaction is one, which maximizes quantity sold by the sellers and minimizes price paid by the buyers.
3. The on-line trading market system as claimed in claim 1, wherein the best fit transaction is one in which a highest volume offered by a seller is matched with a lowest price offered in the aggregated buyer purchase specification.
4. The on-line trading market system as claimed in claim 1, wherein at least one seller pricing schedule is disclosed to at least one buyer.
5. The on-line trading market system as claimed in claim 1, wherein said aggregated buyer purchase specification is disclosed to at least one buyer.
6. The on-line trading market system as claimed in claim 1, wherein said aggregated buyer purchase specification is disclosed to at least one buyer, and said aggregated buyer purchase specification includes a quantity of additional buyers needed to make a specific transaction a best fit transaction.
7. The on-line trading market system as claimed in claim 1, wherein a description of goods or services offered by a seller is disclosed to at least one buyer.
8. The on-line trading market system as claimed in claim 1, wherein a portion of the seller pricing schedule is disclosed to at least one buyer.
9. The on-line trading market system as claimed in claim 1, wherein at least one seller pricing schedule can be automatically modified based on the rate at which the facilitator receives buyer purchase specifications.
10. The on-line trading market system as claimed in claim 1, wherein at least one seller pricing schedule is manually or automatically modified based on information received in at least one buyer purchase specification.
11. The on-line trading market system as claimed in claim 1, wherein a plurality of seller pricing schedules include at least one competing good or service.
12. The on-line trading market system as claimed in claim 11, wherein at least one buyer previously committed to a particular seller is allowed to switch and commit to a different competing seller.
13. The on-line trading market system as claimed in claim 1, wherein the facilitator determines a quantity of sellers admitted to a buying session.
14. The on-line trading market system as claimed in claim 1, wherein the facilitator determines which of a plurality of sellers may participate in a buying session.
15. The on-line trading market system as claimed in claim 1, wherein at least one buyer purchase specification includes a price above which the buyer will not accept a purchase in a specific transaction.
16. The on-line trading market system as claimed in claim 1, wherein at least one buyer is allowed to switch from a first seller to a different second seller based on a predefined price differential between the first seller and the second seller.
17. The on-line trading market system as claimed in claim 1, wherein a message is sent from one buyer to another buyer in a buying session.
18. The on-line trading market system as claimed in claim 1, wherein a buying session is terminated upon exhaustion of seller's supply of goods or services.
19. The on-line trading market system as claimed in claim 1, wherein a buying session having a number of buyers greater than the available supply of goods or services is transacted using a buyer first come first served methodology.
20. The on-line trading market system as claimed in claim 1, wherein a buying session having a number of buyers greater than the available supply of goods or services is transacted using a lottery of buyers methodology.
21. The on-line trading market system as claimed in claim 1, wherein a buying session has a number of buyers greater than the available supply of goods or services, wherein the available supply of goods or services is partitioned into a first portion and a second portion, said first portion being distributed using a buyer first come first served methodology, said second portion being distributed using a lottery of buyers methodology after said first portion is exhausted.
22. The on-line trading market system as claimed in claim 1, wherein a buying session has a number of buyers greater than the available supply of goods or services, wherein the available supply of goods or services is partitioned into a first portion and a second portion, said first portion being distributed using a buyer first come first served methodology, said second portion being distributed using an auction methodology after said first portion is exhausted.
23. The on-line trading market system as claimed in claim 1, wherein at least one seller of said one or more sellers and said facilitator each represent the same organization.
24. An on-line trading market system comprising:
a seller interface for receiving a pricing schedule from one or more sellers via a network;
a buyer interface for receiving a set of purchase specifications from a plurality of buyers via the network; and a facilitator coupled with said seller interface and said buyer interface and configured to aggregate the set of pricing schedules from said plurality of sellers to form an aggregated seller pricing schedule and to determine a best fit transaction based on the buyer purchase specification and the aggregated seller pricing schedule.
a seller interface for receiving a pricing schedule from one or more sellers via a network;
a buyer interface for receiving a set of purchase specifications from a plurality of buyers via the network; and a facilitator coupled with said seller interface and said buyer interface and configured to aggregate the set of pricing schedules from said plurality of sellers to form an aggregated seller pricing schedule and to determine a best fit transaction based on the buyer purchase specification and the aggregated seller pricing schedule.
25. The on-line trading market system as claimed in claim 24, wherein multiple sellers aggregate a supply of goods or services to meet quantity requirements of at least one willing buyer.
26. The on-line trading market system as claimed in claim 24, wherein at least one buyer purchase specification is disclosed to at least one seller.
27. The on-line trading market system as claimed in claim 24, wherein said aggregated seller pricing schedule is disclosed to at least one buyer.
28. The on-line trading market system as claimed in claim 24, wherein said aggregated seller pricing schedule is disclosed to at least one buyer, and said aggregated seller pricing schedule includes a quantity of additional sellers needed to make a specific transaction a best fit transaction.
29. The on-line trading market system as claimed in claim 24, wherein a description of goods or services required by a buyer is disclosed to at least one seller.
30. The on-line trading market system as claimed in claim 24, wherein a portion of the buyer purchase specification is disclosed to at least one seller.
31. The on-line trading market system as claimed in claim 24, wherein at least one buyer purchase specification can be automatically modified based on the rate at which the facilitator receives seller pricing schedules.
32. The on-line trading market system as claimed in claim 24, wherein at least one buyer purchase specification is manually or automatically modified based on information received in at least one seller pricing schedule.
33. The on-line trading market system as claimed in claim 24, wherein a plurality of buyer purchase specifications include at least one competing good or service.
34. The on-line trading market system as claimed in claim 24, wherein at least one seller previously committed to a particular buyer is allowed to switch and commit to a different competing buyer.
35. The on-line trading market system as claimed in claim 24, wherein the facilitator determines a quantity of buyers admitted to a selling session.
36. The on-line trading market system as claimed in claim 24, wherein the facilitator determines which of a plurality of buyers may participate in a buying session.
37. The on-line trading market system as claimed in claim 24, wherein at least one seller pricing schedule includes a price below which the seller will not accept a sale in a specific transaction.
38. The on-line trading market system as claimed in claim 24, wherein a message is sent from one seller to another seller in a selling session.
39. The on-line trading market system as claimed in claim 24, wherein a buying session is terminated upon exhaustion of buyer's requirement for goods or services.
40. The on-line trading market system as claimed in claim 24, wherein a buying session having a number of sellers greater than the available demand for goods or services is transacted using a seller first come first served methodology.
41. The on-line trading market system as claimed in claim 24, wherein a buying session having a number of sellers greater than the available demand for goods or services is transacted using a lottery of sellers methodology.
42. The on-line trading market system as claimed in claim 24, wherein a buying session has a number of sellers greater than the available demand for goods or services, wherein the available demand for goods or services is partitioned into a first portion and a second portion, said first portion being satisfied using a seller first come first served methodology, said second portion being satisfied using a lottery of sellers methodology after said first portion is satisfied.
43. The on-line trading market system as claimed in claim 24, wherein a buying session has a number of sellers greater than the available demand for goods or services, wherein the available demand for goods or services is partitioned into a first portion and a second portion, said first portion being satisfied using a seller first come first served methodology, said second portion being satisfied using an auction methodology after said first portion is satisfied.
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/328,193 US6584451B1 (en) | 1999-01-12 | 1999-06-08 | Facilitator for aggregating buyer power in an on-line market system |
US09/328,193 | 1999-06-08 | ||
PCT/US2000/015982 WO2000075846A1 (en) | 1999-06-08 | 2000-06-08 | A facilitator for aggregating buyer power in an on-line market system |
Publications (1)
Publication Number | Publication Date |
---|---|
CA2376674A1 true CA2376674A1 (en) | 2000-12-14 |
Family
ID=23279922
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002376674A Abandoned CA2376674A1 (en) | 1999-06-08 | 2000-06-08 | A facilitator for aggregating buyer power in an on-line market system |
Country Status (8)
Country | Link |
---|---|
US (1) | US6584451B1 (en) |
EP (1) | EP1198770A4 (en) |
JP (1) | JP2003501752A (en) |
KR (1) | KR20020026449A (en) |
AU (1) | AU5480000A (en) |
BR (1) | BR0011438A (en) |
CA (1) | CA2376674A1 (en) |
WO (1) | WO2000075846A1 (en) |
Families Citing this family (130)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7818212B1 (en) | 1999-10-22 | 2010-10-19 | Ewinwin, Inc. | Multiple criteria buying and selling model |
US7693748B1 (en) | 1991-06-03 | 2010-04-06 | Ewinwin, Inc. | Method and system for configuring a set of information including a price and volume schedule for a product |
US8140402B1 (en) | 2001-08-06 | 2012-03-20 | Ewinwin, Inc. | Social pricing |
US8290824B1 (en) * | 1999-05-12 | 2012-10-16 | Ewinwin, Inc. | Identifying incentives for a qualified buyer |
US8626605B2 (en) | 1999-05-12 | 2014-01-07 | Ewinwin, Inc. | Multiple criteria buying and selling model |
US8311896B2 (en) | 1999-05-12 | 2012-11-13 | Ewinwin, Inc. | Multiple criteria buying and selling model |
US20110213648A1 (en) | 1999-05-12 | 2011-09-01 | Ewinwin, Inc. | e-COMMERCE VOLUME PRICING |
AU4981400A (en) | 1999-05-12 | 2000-12-05 | Ewinwin, Inc. | Multiple criteria buying and selling model, and system for managing open offer sheets |
US7593871B1 (en) | 2004-06-14 | 2009-09-22 | Ewinwin, Inc. | Multiple price curves and attributes |
US7124099B2 (en) * | 1999-05-12 | 2006-10-17 | Ewinwin, Inc. | E-commerce volume pricing |
US7689469B1 (en) | 1999-05-12 | 2010-03-30 | Ewinwin, Inc. | E-commerce volume pricing |
US8732018B2 (en) | 1999-05-12 | 2014-05-20 | Ewinwin, Inc. | Real-time offers and dynamic price adjustments presented to mobile devices |
US7181419B1 (en) | 2001-09-13 | 2007-02-20 | Ewinwin, Inc. | Demand aggregation system |
US7797193B1 (en) * | 1999-06-10 | 2010-09-14 | Simplexity, Llc | Systems and methods for distributing telecommunication services via a network |
US7076447B1 (en) * | 1999-06-10 | 2006-07-11 | Inphonic, Inc. | Systems and methods for aggregating buyers for the purchase of telecommunication services via a network |
US8494917B2 (en) | 1999-06-29 | 2013-07-23 | Priceplay.Com, Inc. | Systems and methods for transacting business over a global communications network such as the internet |
US20060036511A1 (en) * | 1999-06-29 | 2006-02-16 | Lin Wayne W Y | Systems and methods for transacting business over a global communications network such as the internet |
US8050982B2 (en) * | 1999-06-29 | 2011-11-01 | Priceplay, Inc. | Systems and methods for transacting business over a global communications network such as the internet |
US7263505B1 (en) | 1999-06-30 | 2007-08-28 | Kyklos Entertainment S.R.L. | Method and apparatus for generating a sale offer over an electronic network system |
US6934690B1 (en) * | 1999-07-06 | 2005-08-23 | Vulcan Portals, Inc. | System and method for extension of group buying throughout the internet |
US7480627B1 (en) | 1999-07-06 | 2009-01-20 | Vulcan Portals, Inc. | System and method for extension of group buying throughout the internet |
US6928416B1 (en) * | 1999-07-07 | 2005-08-09 | Michael L. Bertash | Virtual client discount pricing |
US6954734B1 (en) * | 1999-07-20 | 2005-10-11 | World Factory, Inc. | Method of producing, selling, and distributing articles of manufacture |
US20030093355A1 (en) * | 1999-08-12 | 2003-05-15 | Gabriel N. Issa, Llc | Method, system and computer site for conducting an online auction |
US7729944B1 (en) | 1999-09-03 | 2010-06-01 | Simplexity, Llc | System and methods for buying and selling telecommunication services via a network |
AUPQ318999A0 (en) * | 1999-10-01 | 1999-10-28 | Minerva Holdings Nv | Method and apparatus for price setting |
US7720743B1 (en) * | 1999-10-27 | 2010-05-18 | Marks Jeffrey S | Methods and apparatus for online auctions and market-places utilizing program terms |
US8251702B2 (en) * | 1999-10-27 | 2012-08-28 | Marks Jeffrey S | Methods and apparatus for online auctions and market-places utilizing program terms |
US8545229B2 (en) | 2000-10-27 | 2013-10-01 | Jeffrey S. Marks | Methods and apparatus for online auctions and market-places utilizing program terms |
US8601373B1 (en) | 1999-11-16 | 2013-12-03 | Ebay Inc. | Network-based sales system with customizable user interface |
US20010034681A1 (en) * | 2000-01-26 | 2001-10-25 | Abbott Preston H. | Methods and systems for financing and executing transactions |
US7451107B1 (en) * | 2000-01-28 | 2008-11-11 | Supply Chain Connect, Llc | Business-to-business electronic commerce clearinghouse |
US20030093414A1 (en) * | 2000-11-14 | 2003-05-15 | Steve Litzow | System and method for dynamic price setting and facilitation of commercial transactions |
US20060053132A1 (en) * | 2004-09-07 | 2006-03-09 | Steve Litzow | System and method for dynamic price setting and facilitation of commercial transactions |
US6907401B1 (en) * | 2000-03-13 | 2005-06-14 | Verizon Corporate Services Group Inc. | Portal switch for electronic commerce |
US20010047308A1 (en) * | 2000-03-31 | 2001-11-29 | Joseph Kaminsky | Concurrent dynamic pricing marketing and selling system |
US7440918B2 (en) * | 2000-04-05 | 2008-10-21 | American Express Travel Related Services Company, Inc. | Interactive demand management |
US20020002500A1 (en) * | 2000-04-13 | 2002-01-03 | Kuniaki Takahashi | Product sales server, product sales system, and sales method |
US7512558B1 (en) * | 2000-05-03 | 2009-03-31 | Quantum Leap Research, Inc. | Automated method and system for facilitating market transactions |
JP2002082840A (en) * | 2000-09-06 | 2002-03-22 | Sony Corp | Method for protecting personal information |
JP2002109325A (en) * | 2000-09-19 | 2002-04-12 | Internatl Business Mach Corp <Ibm> | System and method for buying merchandise, storage medium recorded with program for performing merchandise buying method and server used for the same |
US7860776B1 (en) * | 2000-10-11 | 2010-12-28 | Ebay Inc. | Sales system with buyer price selection |
US20020046127A1 (en) * | 2000-10-18 | 2002-04-18 | Gary Reding | System and method for automated commodities transactions including an automatic hedging function |
JP4519303B2 (en) * | 2000-10-31 | 2010-08-04 | ジーイー・メディカル・システムズ・グローバル・テクノロジー・カンパニー・エルエルシー | Optional parts trading system for medical diagnostic imaging equipment |
US7236944B1 (en) * | 2000-11-22 | 2007-06-26 | Schwartz Scott H | Discount estimating and purchase system and method |
SG99882A1 (en) * | 2001-02-02 | 2003-11-27 | Vchain Corp Ltd | Procurement engine |
US7606744B1 (en) * | 2001-02-16 | 2009-10-20 | Financial Systems Technology (Intellectual Property) Pty. Ltd. | System and method for real-time pricing with volume discounting |
US20020120522A1 (en) * | 2001-02-26 | 2002-08-29 | Yang Chen-Shi | On-line purchasing process using a computer and a system for the same |
WO2002086779A1 (en) * | 2001-03-16 | 2002-10-31 | Sagacious Procurement Pty Limited | Network-based procurement system and method |
US7840475B2 (en) * | 2002-08-01 | 2010-11-23 | Farms Technology, Llc | Methods and systems for purchase of commodities |
US20020169661A1 (en) * | 2001-05-10 | 2002-11-14 | International Business Machines Corporation | Virtual discount system |
AUPR513301A0 (en) * | 2001-05-21 | 2001-06-14 | Kwei, David Wah Hao | System and method for pooled electronic purchasing |
WO2003009105A2 (en) | 2001-07-20 | 2003-01-30 | Fairmarket, Inc. | Automated listing management |
US20030033532A1 (en) * | 2001-08-10 | 2003-02-13 | Body Health Resources Corporation | System and method for forming an on-line buyer's club |
US7716086B2 (en) * | 2001-08-31 | 2010-05-11 | Gateway, Inc. | Electronic retail order communication |
US7386476B1 (en) * | 2001-10-09 | 2008-06-10 | At&T Intellectual Property, Inc. | Small business service buying club systems and methods |
US7680696B1 (en) | 2002-01-12 | 2010-03-16 | Murray Thomas G | Computer processing system for facilitating the order, purchase, and delivery of products |
US7937294B1 (en) | 2002-01-12 | 2011-05-03 | Telegrow, Llc | System, and associated method, for configuring a buying club and a coop order |
US8036950B1 (en) | 2002-02-20 | 2011-10-11 | Emptoris, Inc. | Auction management with business-volume discount |
US20030171998A1 (en) * | 2002-03-11 | 2003-09-11 | Omnicell, Inc. | Methods and systems for consolidating purchase orders |
US7467103B1 (en) | 2002-04-17 | 2008-12-16 | Murray Joseph L | Optimization system and method for buying clubs |
US7899707B1 (en) | 2002-06-18 | 2011-03-01 | Ewinwin, Inc. | DAS predictive modeling and reporting function |
US7689463B1 (en) | 2002-08-28 | 2010-03-30 | Ewinwin, Inc. | Multiple supplier system and method for transacting business |
WO2004040422A2 (en) * | 2002-10-29 | 2004-05-13 | Electronic Broking Services Limited | Trading system |
US7364086B2 (en) | 2003-06-16 | 2008-04-29 | Ewinwin, Inc. | Dynamic discount card tied to price curves and group discounts |
US8590785B1 (en) | 2004-06-15 | 2013-11-26 | Ewinwin, Inc. | Discounts in a mobile device |
US20050004812A1 (en) * | 2003-07-03 | 2005-01-06 | Richard J. Fine | Method and apparatus for linking business interests |
US20050125333A1 (en) * | 2003-12-09 | 2005-06-09 | Giannetti Isaia P. | Pre-order wholesale system and method |
JP4018661B2 (en) * | 2004-04-20 | 2007-12-05 | ディーコープ株式会社 | Network reverse auction control method, control program, and server device |
US7457769B2 (en) * | 2004-04-26 | 2008-11-25 | Emptoris, Inc. | Methods and apparatus for an auction system with interactive bidding |
US20050273405A1 (en) * | 2004-06-04 | 2005-12-08 | Perry Chen | Method and system fro making a conditional event binding on purchasers and vendors |
US7693776B2 (en) * | 2004-07-09 | 2010-04-06 | Ebs Group Limited | Automated trading systems |
AU2005277150B2 (en) * | 2004-08-21 | 2011-05-26 | Directworks, Inc. | Methods, systems, and apparatuses for extended enterprise commerce |
US20060041499A1 (en) * | 2004-08-23 | 2006-02-23 | Transaxtions Llc | Obtaining A Need With Guiding Information And Credit Worthiness Using A Competitive Process |
US10977613B2 (en) * | 2004-10-20 | 2021-04-13 | Dizpersion Technologies, Inc. | Method and system for providing cooperative purchasing over social networks |
US8639604B1 (en) | 2004-10-26 | 2014-01-28 | Invest N Retire, LLC | System and method for managing tax-deferred retirement accounts |
US20060106712A1 (en) * | 2004-11-17 | 2006-05-18 | Min Guo | Method and Apparatus for Online Buyer Oriented Reverse Auction System |
US20060167767A1 (en) * | 2005-01-26 | 2006-07-27 | Verona Steven N | Countdown pricing process |
US20060190381A1 (en) * | 2005-02-01 | 2006-08-24 | Sweeney Michael J | Collective purchase model for medical products |
US20070239593A1 (en) * | 2005-02-01 | 2007-10-11 | Sweeney Michael J | Collective purchase model for medical products |
US20060178977A1 (en) * | 2005-02-07 | 2006-08-10 | Michel Chapelle | Online auction promotion method |
US20060200360A1 (en) * | 2005-03-04 | 2006-09-07 | Aleksey Razletovskiy | Online auction of leads |
KR100727425B1 (en) * | 2005-07-06 | 2007-06-13 | 유씨씨커머스 주식회사 | E-commerce system for the purchasing intermediation type and operating system for the shopping-mall applied thereof |
US20100299222A1 (en) * | 2005-08-19 | 2010-11-25 | Hamilton Iv George B | Online purchasing method |
US8005744B2 (en) * | 2005-09-23 | 2011-08-23 | Alan Hamor | Methods and systems for facilitating bids on products and services |
US20090198622A1 (en) * | 2006-03-10 | 2009-08-06 | Temte John D | Interactive System And Method For Transacting Business Over A Network |
US20070226125A1 (en) * | 2006-03-10 | 2007-09-27 | Temte John D | Interactive system and method for transacting business |
US8612300B2 (en) | 2006-09-08 | 2013-12-17 | Ariba, Inc. | Buyer/supplier network that aids supplier enablement through collaboration between buyers and suppliers |
US20090043671A1 (en) * | 2006-09-14 | 2009-02-12 | Henrik Johansson | System and method for network-based purchasing |
US8255269B1 (en) * | 2006-11-11 | 2012-08-28 | Samir Aued | Data processing method for maximization of present and future supply and/or demand objectives |
US7840447B2 (en) * | 2007-10-30 | 2010-11-23 | Leonard Kleinrock | Pricing and auctioning of bundled items among multiple sellers and buyers |
US20090240628A1 (en) * | 2008-03-20 | 2009-09-24 | Co-Exprise, Inc. | Method and System for Facilitating a Negotiation |
US20090240629A1 (en) * | 2008-03-21 | 2009-09-24 | Jie Xie | System and method for accelerating convergence between buyers and sellers of products |
US20090327034A1 (en) * | 2008-06-27 | 2009-12-31 | eHaggle, LLC | Methods and apparatus for electronic commerce |
US20100180232A1 (en) * | 2009-01-13 | 2010-07-15 | David John Honan | Method and System for Grouping Buyers Based on Common Interests |
US8650072B2 (en) | 2009-05-05 | 2014-02-11 | Groupon, Inc. | System and methods for providing location based discount retailing |
US8355948B2 (en) | 2009-05-05 | 2013-01-15 | Groupon, Inc. | System and methods for discount retailing |
US8301495B2 (en) | 2009-05-05 | 2012-10-30 | Groupon, Inc. | System and methods for discount retailing |
WO2011109690A2 (en) * | 2010-03-04 | 2011-09-09 | Geldres Arthur E | Consumption engine |
US8280760B1 (en) * | 2010-04-30 | 2012-10-02 | Intuit Inc. | Generating pricing estimates |
US8732036B2 (en) | 2010-05-07 | 2014-05-20 | Ariba, Inc. | Supplier/buyer network that provides catalog updates |
US8392317B2 (en) | 2010-11-09 | 2013-03-05 | Ariba, Inc. | Facilitating electronic auction of prepayment of an invoice |
US8538858B2 (en) | 2011-02-23 | 2013-09-17 | Farms Technology, Llc | Apparatus and method for commodity trading with automatic odd lot hedging |
US9990634B2 (en) | 2011-05-22 | 2018-06-05 | Ariba, Inc. | Managing an experience of a member organization of a collaborative commerce community through a network |
US9836773B2 (en) | 2011-05-22 | 2017-12-05 | Ariba, Inc. | Evaluation and selection of quotes of a commerce network |
US8688537B2 (en) | 2011-05-22 | 2014-04-01 | Ariba, Inc. | Maintenance of a company profile of a company associated with a supplier/buyer commerce network |
US10102595B2 (en) * | 2012-03-08 | 2018-10-16 | Embertec Pty Ltd | Power system |
US10255620B1 (en) | 2013-06-27 | 2019-04-09 | Groupon, Inc. | Fine print builder |
US10304091B1 (en) | 2012-04-30 | 2019-05-28 | Groupon, Inc. | Deal generation using point-of-sale systems and related methods |
US10664876B1 (en) | 2013-06-20 | 2020-05-26 | Groupon, Inc. | Method and apparatus for promotion template generation |
US10664861B1 (en) | 2012-03-30 | 2020-05-26 | Groupon, Inc. | Generating promotion offers and providing analytics data |
US10147130B2 (en) | 2012-09-27 | 2018-12-04 | Groupon, Inc. | Online ordering for in-shop service |
US10304093B2 (en) | 2013-01-24 | 2019-05-28 | Groupon, Inc. | Method, apparatus, and computer readable medium for providing a self-service interface |
US9996859B1 (en) | 2012-03-30 | 2018-06-12 | Groupon, Inc. | Method, apparatus, and computer readable medium for providing a self-service interface |
US10192243B1 (en) | 2013-06-10 | 2019-01-29 | Groupon, Inc. | Method and apparatus for determining promotion pricing parameters |
US11386461B2 (en) | 2012-04-30 | 2022-07-12 | Groupon, Inc. | Deal generation using point-of-sale systems and related methods |
US20130304602A1 (en) * | 2012-05-04 | 2013-11-14 | Frank J. Uxa, Jr. | Marketing Methods |
US20130339118A1 (en) * | 2012-06-14 | 2013-12-19 | Gbl Systems Corporation | Bulk purchasing by ad hoc consumer groups |
US20140236748A1 (en) * | 2013-02-20 | 2014-08-21 | Kiruba Sivasubramaniam Haran | Method and system for online purchases by collective bargaining units that are generated to allow users to negotiate better prices with vendors |
US9161669B2 (en) | 2013-03-01 | 2015-10-20 | Omachron Intellectual Property Inc. | Surface cleaning apparatus |
US10032193B1 (en) * | 2013-03-12 | 2018-07-24 | United Services Automobile Association (Usaa) | Systems and methods for facilitating purchases |
US20140297507A1 (en) * | 2013-03-28 | 2014-10-02 | Tencent Technology (Shenzhen) Company Limited | Method, device and system for collaborative order |
WO2015120606A1 (en) * | 2014-02-13 | 2015-08-20 | Www.Iwant.Com Limited | System and method for facilitating transactions |
US9740979B2 (en) | 2015-12-06 | 2017-08-22 | Xeeva, Inc. | Model stacks for automatically classifying data records imported from big data and/or other sources, associated systems, and/or methods |
WO2018223225A1 (en) * | 2017-06-05 | 2018-12-13 | Mécanique Groupes B.N.G. Inc. | Crowd-based e-commerce system and method |
US11263707B2 (en) | 2017-08-08 | 2022-03-01 | Indigo Ag, Inc. | Machine learning in agricultural planting, growing, and harvesting contexts |
CN108446982A (en) * | 2018-04-12 | 2018-08-24 | 雷学军 | The method of the hot oxygen transaction of entity carbon |
EP3785214A1 (en) | 2018-04-24 | 2021-03-03 | Indigo Ag, Inc. | Interaction management in an online agricultural system |
US11367093B2 (en) | 2018-04-24 | 2022-06-21 | Indigo Ag, Inc. | Satellite-based agricultural modeling |
WO2023034386A1 (en) | 2021-08-31 | 2023-03-09 | Indigo Ag, Inc. | Systems and methods for ecosystem credit recommendations |
Family Cites Families (34)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3581072A (en) | 1968-03-28 | 1971-05-25 | Frederick Nymeyer | Auction market computation system |
JPH0743748B2 (en) | 1986-02-17 | 1995-05-15 | 株式会社オークネット | Information transmission processing method of auction information transmission processing system |
US5136501A (en) | 1989-05-26 | 1992-08-04 | Reuters Limited | Anonymous matching system |
US5101353A (en) | 1989-05-31 | 1992-03-31 | Lattice Investments, Inc. | Automated system for providing liquidity to securities markets |
GB9027249D0 (en) | 1990-12-17 | 1991-02-06 | Reuters Ltd | Offer matching system |
JP2522898B2 (en) | 1992-09-08 | 1996-08-07 | インターナショナル・ビジネス・マシーンズ・コーポレイション | Dynamic customization method and graphic resource editor |
US5794219A (en) | 1996-02-20 | 1998-08-11 | Health Hero Network, Inc. | Method of conducting an on-line auction with bid pooling |
US5794207A (en) | 1996-09-04 | 1998-08-11 | Walker Asset Management Limited Partnership | Method and apparatus for a cryptographically assisted commercial network system designed to facilitate buyer-driven conditional purchase offers |
US5689652A (en) | 1995-04-27 | 1997-11-18 | Optimark Technologies, Inc. | Crossing network utilizing optimal mutual satisfaction density profile |
US5845266A (en) | 1995-12-12 | 1998-12-01 | Optimark Technologies, Inc. | Crossing network utilizing satisfaction density profile with price discovery features |
US5615109A (en) * | 1995-05-24 | 1997-03-25 | Eder; Jeff | Method of and system for generating feasible, profit maximizing requisition sets |
US5826244A (en) * | 1995-08-23 | 1998-10-20 | Xerox Corporation | Method and system for providing a document service over a computer network using an automated brokered auction |
US5745765A (en) | 1995-10-23 | 1998-04-28 | Calico Technology, Inc. | Method and apparatus for automatic and interactive configuration of custom products |
JP3133243B2 (en) | 1995-12-15 | 2001-02-05 | 株式会社エヌケーインベストメント | Online shopping system |
US5905975A (en) | 1996-01-04 | 1999-05-18 | Ausubel; Lawrence M. | Computer implemented methods and apparatus for auctions |
US6055518A (en) | 1996-02-01 | 2000-04-25 | At&T Corporation | Secure auction systems |
US5799284A (en) | 1996-03-13 | 1998-08-25 | Roy E. Bourquin | Software and hardware for publishing and viewing products and services for sale |
US5774873A (en) | 1996-03-29 | 1998-06-30 | Adt Automotive, Inc. | Electronic on-line motor vehicle auction and information system |
US5835896A (en) | 1996-03-29 | 1998-11-10 | Onsale, Inc. | Method and system for processing and transmitting electronic auction information |
US5812668A (en) | 1996-06-17 | 1998-09-22 | Verifone, Inc. | System, method and article of manufacture for verifying the operation of a remote transaction clearance system utilizing a multichannel, extensible, flexible architecture |
US6014643A (en) | 1996-06-28 | 2000-01-11 | Minton; Vernon F. | Interactive securities trading system |
US5812572A (en) | 1996-07-01 | 1998-09-22 | Pacific Fiberoptics, Inc. | Intelligent fiberoptic transmitters and methods of operating and manufacturing the same |
US5890138A (en) | 1996-08-26 | 1999-03-30 | Bid.Com International Inc. | Computer auction system |
US5862223A (en) | 1996-07-24 | 1999-01-19 | Walker Asset Management Limited Partnership | Method and apparatus for a cryptographically-assisted commercial network system designed to facilitate and support expert-based commerce |
US5844554A (en) | 1996-09-17 | 1998-12-01 | Bt Squared Technologies, Inc. | Methods and systems for user interfaces and constraint handling configurations software |
US5966699A (en) | 1996-10-11 | 1999-10-12 | Zandi; Richard | System and method for conducting loan auction over computer network |
US5950001A (en) | 1997-06-03 | 1999-09-07 | Sun Microsystems, Inc. | Method and apparatus for customizing a software component |
JPH1125362A (en) * | 1997-06-30 | 1999-01-29 | Jiyakosu:Kk | Merchandise distribution system |
US6146272A (en) * | 1997-08-15 | 2000-11-14 | Walker Digital, Llc | Conditional lottery system |
US5913210A (en) | 1998-03-27 | 1999-06-15 | Call; Charles G. | Methods and apparatus for disseminating product information via the internet |
AU5898099A (en) * | 1998-08-25 | 2000-03-14 | Accompany Inc. | On-line marketing system and method |
US6101484A (en) * | 1999-03-31 | 2000-08-08 | Mercata, Inc. | Dynamic market equilibrium management system, process and article of manufacture |
CA2315457A1 (en) * | 1999-08-16 | 2001-02-16 | Tactical Retailing Solutions, L.L.C. | Method for providing consumers with offers |
US7440918B2 (en) * | 2000-04-05 | 2008-10-21 | American Express Travel Related Services Company, Inc. | Interactive demand management |
-
1999
- 1999-06-08 US US09/328,193 patent/US6584451B1/en not_active Expired - Lifetime
-
2000
- 2000-06-08 KR KR1020017015792A patent/KR20020026449A/en not_active Application Discontinuation
- 2000-06-08 EP EP00939766A patent/EP1198770A4/en not_active Withdrawn
- 2000-06-08 CA CA002376674A patent/CA2376674A1/en not_active Abandoned
- 2000-06-08 JP JP2001502045A patent/JP2003501752A/en active Pending
- 2000-06-08 WO PCT/US2000/015982 patent/WO2000075846A1/en not_active Application Discontinuation
- 2000-06-08 AU AU54800/00A patent/AU5480000A/en not_active Abandoned
- 2000-06-08 BR BR0011438-3A patent/BR0011438A/en not_active Application Discontinuation
Also Published As
Publication number | Publication date |
---|---|
EP1198770A4 (en) | 2003-01-08 |
JP2003501752A (en) | 2003-01-14 |
AU5480000A (en) | 2000-12-28 |
KR20020026449A (en) | 2002-04-10 |
EP1198770A1 (en) | 2002-04-24 |
WO2000075846A1 (en) | 2000-12-14 |
US6584451B1 (en) | 2003-06-24 |
BR0011438A (en) | 2002-03-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6584451B1 (en) | Facilitator for aggregating buyer power in an on-line market system | |
Dolan et al. | Article not available electronically: Pricing and Market Making on the Internet, Robert J. Dolan, Youngme Moon | |
US6564192B1 (en) | Method and system for differential index bidding in online auctions | |
US6671674B1 (en) | Computer-based auction and sale system | |
US20030093355A1 (en) | Method, system and computer site for conducting an online auction | |
US20100250360A1 (en) | Trading Platform for the Redemption of Promotional Currency from Multiple Loyalty Programs | |
JP2006513506A (en) | Automated system to route orders for financial products based on undisclosed liquidity | |
KR101487492B1 (en) | On-line sales system using of a social auction | |
JP2003516591A (en) | Automated exchanger for efficient allocation of viewer items | |
JPH11353361A (en) | Commodity selling system in communication network | |
US7885853B2 (en) | System and method for hybrid single and aggregation sale | |
JP2002007765A (en) | Negotiating transaction intermediating device, method and system thereof, and information recording medium | |
JP2002007720A (en) | System and method for commodity transaction, and recording medium | |
CA2563850A1 (en) | System and method for a continuous auction market with dynamically triggered temporal follow-on auctions | |
US20120047076A1 (en) | System, method and computer program for negotiating online transactions | |
US20120203612A1 (en) | Computerized Auction Software Method for Providing a Discount Off a High Bid Before a Bid is Placed | |
EP1247218A1 (en) | Aggregating on-line purchase requests | |
KR20010095929A (en) | The method of collective purchase through competitive public tender. | |
KR20000024038A (en) | Method for cooperative buying with the lowest price through internet | |
US20030115127A1 (en) | Method of market basket bidding for surplus merchandise | |
US20090055286A1 (en) | Inverse multiple auction | |
JP2001250076A (en) | Device, system and method for negotiated transaction by negotiation and information recording medium | |
KR20050005724A (en) | Payment method and price decision of the travel package | |
WO2001067308A1 (en) | A computer system and method for providing a seller/buyer environment over a network | |
US20230067308A1 (en) | Internet based platform implemented with machine learning software to provide otherwise unobtainable transaction based data and platform operations |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request | ||
FZDE | Discontinued |