US8463694B2 - Method and system to enable a fixed price purchase within a multi-unit online auction environment - Google Patents

Abstract

A method includes presenting to a buyer a multi-unit auction, permitting the buyer to bid one or more of a price and a number of units in the auction, and permitting the buyer to re-bid in the auction. The auction includes a rule that prevents the buyer from reducing the price in the re-bid, and the auction further includes a rule that prevents the buyer from reducing the number of units in the re-bid.

Description

RELATED APPLICATION

This application is a divisional of U.S. patent application Ser. No. 11/167,999, filed Jun. 28, 2005 now U.S. Pat No. 7,650,307, which is incorporated herein by reference in its entirety.

FIELD OF THE INVENTION

The present invention relates generally to the field of e-commerce and, more specifically, to a pre-auction seller determined price for an Internet-based multi-unit auction facility.

BACKGROUND OF THE INVENTION

Many Internet-based auction facilities have developed in the past several years. Through Internet-based auction facilities, potential sellers can enter information about their product or service for potential buyers to bid on. The information submitted by potential sellers is then organized and stored by the Internet-based auction facility. Potential buyers can search through the organized seller information to find products or services they wish to bid on.

Once a buyer locates an item to bid on, the buyer can compete with other buyers for the item by submitting bids during a specified auction time period. At the end of the specified auction time period, the highest bid buyer is notified and the transaction between the seller and the highest bid buyer is facilitated.

While the current Internet-based auction facility works well for some items, there are several disadvantages. For example, many items in an Internet-based auction facility have at most one bid during the specified auction time. An interested buyer must sometimes wait days for an auction to end even though his bid is the only bid received. Also, there are many potential buyers who don't like auction formats.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements and in which:

FIG. 1 is a block diagram illustrating an exemplary network-based transaction facility in the form of an Internet-based auction facility.

FIG. 2 is a database diagram illustrating an exemplary database for the transaction facility.

FIG. 3 is a flow chart illustrating an exemplary method of receiving offering information from a seller including whether to offer the item at a pre-auction seller determined price.

FIG. 4 is a flow chart illustrating an exemplary method of generating a buyer preferred index page using category preferences or search criteria.

FIGS. 5A and 5B are flow charts illustrating an exemplary method of displaying user interfaces for and conducting an auction facility with an auction purchase process and optionally a fixed-price purchase process.

FIG. 6 illustrates an exemplary seller interface to receive information on seller's offerings.

FIG. 7 illustrates an exemplary buyer interface to facilitate a buyer in locating items to purchase or bid on.

FIG. 8 illustrates an exemplary item list generated in response to buyer's category selection or search criteria provided in the user interface ofFIG. 7.

FIG. 9 illustrates an exemplary buyer interface used to receive buyer information including an indication to use the fixed-price purchase process or the auction purchase process.

FIG. 10 illustrates an exemplary method in which a fixed-price option is available in a multi-unit auction as long as items have not been bid on.

FIG. 11 illustrates an exemplary method maintaining an item available for fixed-price purchase in a multi-unit auction based on the current price, a threshold, and the number of bids on the item.

FIG. 12 illustrates an exemplary method of permitting re-bids in a multi-unit auction.

FIG. 13 illustrates an exemplary method of permitting a user to purchase an item at a fixed-price during a multi-unit auction when that user has an outstanding bid.

DETAILED DESCRIPTION

A method and system for providing an option to sell and buy at a pre-auction seller determined price in an Internet-based auction facility are described. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be evident, however, to one skilled in the art that the present invention may be practiced without these specific details.

Terminology

For the purposes of the present specification, the term “transaction” shall be taken to include any communications between two or more entities and shall be construed to include, but not be limited to, commercial transactions including sale and purchase transactions, auctions and the like.

Transaction Facility

To better understand the invention, an embodiment of an electronic transaction facility is shown inFIGS. 1 and 2.

FIG. 1 is a block diagram illustrating an exemplary network-based transaction facility in the form of an Internet-basedauction facility10. While an exemplary embodiment of the present invention is described within the context of an auction facility, it will be appreciated by those skilled in the art that the invention will find application in many different types of computer-based, and network-based, commerce facilities. It will also be appreciated by those skilled in the art that the invention may be used in auction facilities of other architectures. The instructions stored in the auction facility (which can be executed by a processor) can be stored on a machine-readable medium including, but not limited to read only memory (ROM), random access memory (RAM), magnetic disk storage media, optical storage media, flash memory devices, or electrical, optical, acoustical or other form of propagated signals.

Theauction facility10 includes one or more of a number of types of front-end servers, namelypage servers12 that deliver web pages (e.g., markup language documents),picture servers14 that dynamically deliver images to be displayed within Web pages, listingservers16,CGI servers18 that provide an intelligent interface to the back-end ofauction facility10, andsearch servers20 that handle search requests to theauction facility10. E-mailservers21 provide, inter alia, automated e-mail communications to users of theauction facility10.

The back-end servers include adatabase engine server22, asearch index server24 and a credit card database server26, each of which maintains and facilitates access to a respective database.

The Internet-basedauction facility10 may be accessed by aclient program30, such as a browser (e.g., the Internet Explorer distributed by Microsoft Corp. of Redmond Wash.) that executes on aclient machine32 and accesses theauction facility10 via a network such as, for example, the Internet34. Other examples of networks that a client may utilize to access theauction facility10 include a wide area network (WAN), a local area network (LAN), a wireless network (e.g. a cellular network), or the Plain Old Telephone Service (POTS) (or PSTN) network.

Database Structure

FIG. 2 is a database diagram illustrating anexemplary database23, maintained by and accessed via thedatabase engine server22, which at least partially implements and supports theauction facility10. Thedatabase23 may, in one embodiment, be implemented as a relational database, and includes a number of tables having entries, or records, that are linked by indices and keys. In an alternative embodiment, thedatabase23 may be implemented as a collection of blocks in a block-oriented database. WhileFIG. 2 shows one embodiment of a database, it will be appreciated by those skilled in the art that the invention can be used with other database structures.

Central to thedatabase23 is a user table40, which contains a record for each user of theauction facility10. A user may operate as a seller, buyer, or both, withinauction facility10. Thedatabase23 also includes item tables42 that may be linked to the user table40. Specifically, the item tables42 include a seller items table44 and a buyer items table46. A user record in the user table40 may be linked to multiple items that are being, or have been auctioned via theauction facility10. A link indicates whether the user is a seller or a buyer with respect to items for which records exist within the items tables42. While offerings by the seller are referred to as “items” in the specification, “items” includes any product or service offered by the seller. Thedatabase23 also includes a note table48 populated with note records that may be linked to one or more item records within the item tables42 and/or to one or more user records within the user table40. Each note record within the note table48 may include, inter alia, a comment, description, history or other information pertaining to an item being auctioned via theauction facility10 or to a user of theauction facility10.

A number of other tables are also shown to be linked to the user table40, namely a user past aliases table50, a feedback table52, a bids table54, an accounts table56, and an account balances table58.

FIG. 3 shows a flowchart for an exemplary embodiment of a method to acquire offering information from a seller. The seller issues a listing request (block100) to theauction facility10, and the auction facility generates instructions (block110) offering the seller the option to sell his item using an auction purchase process option and/or a fixed-price purchase process option. After the instructions have been transmitted (block120), and a page server12 (seeFIG. 1) displays the instructions, the seller decides whether to offer a buyer the chance to buy the offering at a pre-auction seller determined price in a fixed-price purchase process. The seller transmits a purchase process indicator by either an affirmative (block140) or a negative (block150). The server can receive and store in note table48 of database23 (FIG. 2) this information for later use (block160). The seller also transmits other offering information, such as a description, picture, reserve price, and contact information to be collected and stored in note table48 of database23 (seeFIG. 2) (block160). Optionally, if the seller sends a pre-auction seller determined price that is less than the reserve price he or she sends, the seller can be notified of an error.

FIG. 4 shows a flow chart showing one embodiment of a buyer's interaction with the Internet-based auction facility. The buyer locates the site by inputting the auction facility identifier (block600) into theclient program30 running on client machine32 (seeFIG. 2) which transmits the auction facility identifier (block610) through the Internet34 (SeeFIG. 1). The Internet-based auction facility receives the transmission and (block620) a listing server16 (seeFIG. 1) generates a broad list of available categories of items stored in items table42 (seeFIG. 2) for the buyer to select from. The auction facility10 (block630) transmits the category list and transmits an interface, which can be presented by a page server12 (seeFIG. 1), to allow the buyer to enter search criteria which may be independent of the category list. The buyer selects a category preference from the category list or generates a search criteria (block640). The buyer then transmits (block650) the category preference or search criteria, again, through the Internet34 (seeFIG. 1). Upon receipt of the category preference or search criteria, the auction facility uses a search server20 (seeFIG. 1) to generate an item index page of relevant offerings including visual indicators displayed in respect to items in which the seller is allowing a buyer to buy the item at a pre-auction seller determined price (block660). The item index page is transmitted to the buyer (block680). After receiving the item index page (block670), the buyer generates a request for an item to purchase or bid on. Picture servers14 (seeFIG. 1) can also be used to show the buyer pictures (if available) of the item. The buyer's request is then transmitted (block20).

FIG. 5 shows a flow chart illustrating how the client interfaces with the auction facility, located on a first computer system, when a pre-auction seller determined price is an alternative option to bidding. After the facility receives the buyer's request (block200),decision block210 decides if there is still time remaining in the item's auction (item requested by the buyer). If a predetermine period of time has passed, the buyer will not be allowed to place a bid or buy at the pre-auction seller determined price. Instead the auction will end and the highest bidder (if there is one) will be determined (block380). If there is time remaining, then the determination is made indecision block220 whether a prior bid has been received. If a prior bid has been received, then the pre-auction seller determined price is no longer available to the buyer and the buyer's only option is to bid. If no prior bid has been received, and the item has a pre-auction seller determined price available, a first user interface will be created (block230). Theauction facility10 will make the typical auction purchase process available through the user interface (block240) and will make the fixed price purchase process available to the client (block250). The pre-auction seller determined price is retrieved for the user interface (block260). The first user interface is converted into a markup language document suitable for viewing by the buyer (block270). The generated markup language document is then transmitted for viewing by the buyer on a second computer system usingpage servers12 on the first computer system (block280) (seeFIG. 1).

If, atdecision block220, it is determined that an initial bid value has been received, a second user interface will be generated (block390). The typical auction purchase process is then made available through the user interface (block400). The second user interface is converted into a markup language document suitable for viewing by the buyer (block270). The generated markup language document is then transmitted to the buyer (block280).

After the markup language document has been transmitted to the buyer, a determination is made atdecision block420, based on the transmitted markup language document whether the fixed price purchase process is available to the buyer. If the fixed price purchase process is available to the buyer, the buyer then makes a determination atdecision block290 whether to buy the item at the pre-auction seller determined price or whether to bid on the item. If the buyer chooses to purchase the item using the fixed price purchase process, his indication to buy at the pre-auction seller determined price is transmitted to the auction facility.

If the fixed price purchase process is not available to the buyer (as determined in decision block420) or fixed price purchase process is available, but the buyer chooses not to use the fixed price purchase process, the buyer generates a bid (block310). The bid is then transmitted to the auction facility (block320).

Upon receiving a transmission from the buyer, a determination is made atdecision block330 whether the buyer has chosen the fixed price purchase process. If the buyer has chosen the fixed price purchase process, the auction is stopped (if the quantity in the auction is fully sold) (block340) and a transaction is initiated between the buyer and the seller (block410). Optionally, the auction facility can check the buyer's credit before stopping the auction.

If the buyer has not opted to use the fixed price purchase process, as determined by the auction facility at decision block330 (either because it wasn't available or he or she preferred to place a bid instead), the bid is received (block350). Optionally, if the bid is greater than the pre-auction seller determined price (and the fixed price purchase process is still available), the auction facility may invite the buyer to use the fixed price purchase process. Upon receipt of the bid, the fixed price purchase process option is removed (block360) and a determination is made atdecision block370 to see if there is any time remaining in the auction. If there is time remaining in the auction, bids can be received and processed in the above manner until there is no more time remaining in the auction. However, if there is no more time remaining in the auction, the highest valid bid is determined from the received bids (block380), and a transaction is initiated between the highest bidder and the seller (block410).

FIG. 6 provides an exemplary embodiment of theuser interface500 created atblock110 inFIG. 3 to relay offering options to the seller and collect information on the seller's item. Theuser interface500 gives the seller the option to allow a buyer to buy the item at a pre-auction sellerdetermined price514.

FIG. 7 provides an exemplary embodiment of thecategory list517 and search criteria request generated byobject620 inFIG. 4. A buyer can generate search criteria (block640) by typing the search criteria (block516).

FIG. 8 provides an exemplary embodiment of the item index page generated atblock660 inFIG. 4. A possible placement of the fixed-price purchaseprocess availability icon518 is shown next to the item. Also displayed in the embodiment of the item index page is a list ofprices514 which could either be the current bid or the pre-auction seller determined price if available.

FIG. 9 shows an exemplary embodiment of, the markup language document generated atblock270 inFIG. 5. Regular auction panel503 is generated (blocks240 and400). Fixed price purchase process panel504 is generated (block250) inFIG. 5. The buyer can submit a bid520 or, depending on the availability of the fixed price purchase process, can start the fixed price purchase process in panel504.

In an embodiment, the option of purchasing an auction item at a fixed price in a single-item auction is extended to purchasing one or more units of an item at a fixed price in a multi-unit auction (also known as a Dutch auction). In either the single item or multi-unit auction, this option to purchase an item at a fixed price may be referred to as a Buy-It-Now (BIN) feature. In different embodiments, the availability of the BIN feature over the course of the auction may change. In one embodiment of the BIN feature, the BIN feature is persistent, or in other words, available throughout the entirety of the auction. In other embodiments of this BIN feature, the BIN feature disappears after certain conditions are met.

An embodiment of aprocess1000 in which the BIN features disappears during the course of an auction is referred to as a temporary BIN and is illustrated inFIG. 10. In the temporary BIN embodiment, a fixed-price purchase option is made available in a multi-unit auction at1010, and the BIN feature remains available throughout the auction for any units that have not yet been bid on (1020). For example, if 10 units of an item are available in an auction, and Bidder A bids on three units, and Bidder B bids on two units, then five units remain available for BIN purchase. When all the units have been bid on, the fixed-price purchase option is removed from the auction at1030.

Another embodiment in of aprocess1100 in which the BIN feature disappears during the course of an auction is referred to as a semi-persistent BIN an is illustrated inFIG. 11. In a semi-persistent embodiment of the BIN feature, a fixed-price purchase option is made available in a multi-unit auction at1110, and a configurable threshold between 0% and 100% inclusive is posited at1120. Then, units of an item will be available for BIN at1150 as long as either the current auction price (or the current auction price after bid) is below the threshold at1130, or, the unit has not yet been bid on at1140. Otherwise, the fixed-price purchase option will not be available (1160,1170). The current auction price after bid may be determined by one or more pricing rules. In an embodiment, the current price after bid is set to a low value (such as 1) at the beginning of an auction. As soon as a bidder becomes a partial loser (i.e. the bidder will not receive all the units he has bid on because other bidders have bid higher), the current price after bid is set to the partial loser's maximum bid price. Then, when a bidder becomes a full loser, the current price after bid is set to that bidder's maximum price plus one increment. This is referred to as Vickrey pricing.

Specifically, in an embodiment, the starting price of the auction is set to be less than or equal to the BIN price. The threshold is set to a certain value between 0% and 100% inclusive. When the variable is equal to 100%, the BIN feature is available throughout the auction for that item irrespective of the number of bids on that item. When the variable is equal to 0%, every bid on that item counts and consequently reduces the number of units of that item available for BIN on a one for one basis (i.e., for every unit bid on, the number of units available for BIN is reduced by one). If the number of units that are available for BIN reduces to 0, then in an embodiment the BIN option disappears from the auction.

For example, if the threshold is set to 0% (i.e., every unit bid for will affect the units available for BIN, since the current auction price will always be equal to or greater than 0% of the BIN price), the starting price for an item is 1, the BIN price is 10, and the total number of available units of these items is 10, then an example scenario is as follows:

	Number of Units	Number of Units	Number of Units
Bidder	Available for Bid	Available for BIN	Requested inBid

A

	10	10	3
B	10	7	6
C	10	1	1
D	10	0	2

As the above table shows, as each bidder requests a number of units for an item in a bid, the number of units of that item available for BIN decreases by the number of units requested in the bid. For example, after bidder A requested three units in a bid, bidder B had available to him for BIN only 7 units of the item. Then, after bidder C placed a bid for one unit, the number of requested bids for that item equaled the total quantity of that item, and the quantity available for BIN was reduced to zero. That is, after bidder C placed a bid, the total number of items with a bid thereon (3, 6, 1) equaled the total quantity of items that were available (10). In an embodiment, the user interface of the auction displays to the user the number of units available for BIN. For example, when bidder B is in the process of bidding, the user interface will indicate that there are 7 units available for BIN, and that if the user would like to exercise the BIN option, the user should enter 7 units or fewer.

In another embodiment, the number of units of an item that are available for BIN always remains the same irrespective of the number of units requested in a bid or bids. For example, in this embodiment, the threshold is set to 100, the start price is 1, the BIN price is 10, and the total quantity of available items is 10 (and assuming that each buyer's maximum bid price is 9). Then, for example, referring to the table below,

	Number of Units	Number of Units	Number of Units
Bidder	Available for Bid	Available for BIN	Requested inBid
A
	10	10	3
B	10	10	6
C	10	10	1
D	10	10	2

it can be seen that irrespective of the number of units requested in a bid by a user, the number of units available for BIN remains the same for the duration of the auction. In this embodiment, the current price after bid, once again assuming that each bidder's maximum bid is 9 (because of a rule that disallows a user from placing a bid equal to or above the BIN price when the threshold is set to 100), will never be equal to or greater than 100% of the BIN price (10). Therefore, BIN will always remain an option in this auction; it will not be removed. In this case, the number of items that have received bids is neglected, and the maximum bid prices for those bids are neglected.

In yet another embodiment, the number of units of an item available for BIN remains constant throughout the bidding process until the current bid price (or current price after bid) is equal to a certain percentage of the BIN price. In an example of this embodiment, the threshold is set to 70, the start price is set to 1, the BIN price is set to 10, the bidding increment is set to 1, and the total quantity available for this item is 10. Then, a sequence of bidders and bids may be as follows:

Bidder	Max Bid	QABID	QABIN	QRBID	CPAB

A	6	10	10	3	1
B	8	10	10	5	1
C	8	10	10	3	6
D	9	10	10	2	7
E	9	10	0	3	8
F	9	10	0	3	8
Wherein
Max Bid is a Bidder's maximum bid
QABID is the quantity available for bid
QABIN is the quantity available for BIN
QRBID is the quantity requested in a bid
CPAB is the current price after a bid

Referring to the above table, Bidder A first bids on three units, Bidder B then bids on five units, and then Bidder C bids on 3 units. At this point, Bidder A has become a partial loser (because the total quantity of units requested in the bids of A, B, and C are now equal to 11, and there are only ten units available for bid). The current price after bid, per Vickrey pricing, is set to six—the maximum bid of Bidder A. Thereafter, Bidder D bids for two units, making Bidder A a full loser, and the current price after bid is set to Bidder A's maximum bid plus one. This raises the current price after bid to seven, which is equal to 70%, or the threshold, of the BIN price. Since the current price after bid now is equal to (or is not below) the threshold percentage of the BIN price, and all units have been bid on (total of units bid on for A, B, C, and D is 13), the BIN option is removed from this particular auction session.

In another example of a situation in which the quantity available for BIN is determined by the current price after bid as a percentage of BIN price, assume that the threshold is set to 80%, the start price is 80, the BIN price is 100, and the number of units available for purchase is 10. The following example illustrates an embodiment of such an example.

Bidder	Max Bid	QABID	QABIN	QRBID	CPAB

A	82	10	10	3	80
B	85	10	7	6	80
C	89	10	1	3	82
D	93	10	0	8	89
E	96	10	0	3	93

In this example, since the starting price (also the current price after bid in this case) is greater than or equal to the threshold percentage (80%) of the BIN price, every bid and quantity counts. For example, after Bidder A places a bid on three units, the units available for BIN decreases from ten units to seven units. Then, after Bidder C places his bid, the total quantity of units upon which there are outstanding bids is twelve (Bidder A, 3; Bidder B, 6; Bidder C, 3), and the BIN option is removed from the auction.

In an embodiment, an auction system can variably offer a temporary BIN feature, a permanent BIN feature, or a semi-permanent BIN feature. In such an embodiment, the type of the BIN feature may be changed by simply changing a variable in the system that represents the threshold in the system from 0% to 100% inclusive.

Another embodiment of a multi-unit auction is aprocess1200 as illustrated inFIG. 12 that allows bidders to re-bid during the auction. A multi-unit auction is made available to a user at1210, and re-bidding is permitted at1220. This re-bid feature is accompanied by rules that prevent downward price movements and associated gaming of the auction system. Specifically, in such an embodiment, a bidder is not allowed to reduce the price in the re-bid at1230 (compared to the previous bid). Additionally, a bidder in a re-bid is not permitted to reduce the quantity of units of an item in the re-bid at1240. In another embodiment, there is an exception to the quantity reduction prohibition. That exception is that if a bidder is “fully losing” the auction—i.e. the bidder is currently winning zero units in the auction of a particular item, the bidder may reduce the quantity of an item bid for to a minimum of one unit.

Another embodiment or anexemplary method1300 is illustrated inFIG. 13 and further prevents price reductions and associated gaming of multi-unit auctions that permit a BIN feature. In such an embodiment, a fixed-price purchase option is made available (1310), and if a user, who presently has an outstanding bid for X units of an item, decides to buy Y units now (BIN) (1320), that bidder's outstanding bid will be reduced from the X units to a maximum of (X-Y) units or zero units (1330) (i.e. max(X-Y, 0)) (i.e. in general, the person's bid will be reduced by the number of BIN units). Further, that bidder's bid price for the remaining units in the bid will remain the same, and a bid that is reduced to zero units is removed from the system (1340). Additionally, in this embodiment, if a person decides to buy a quantity of units now, the number of units available in the auction will be reduced on a one for one basis (1350). However, another person (not the one who executed the BIN) who bid on X units before a BIN was executed, will still be considered by the system as bidding on X units after the BIN (even if X is now greater than the number of units available in the auction after the BIN) (1360). Moreover, if that person re-bids, he must re-bid for at least X units since he cannot reduce his quantity in a re-bid (unless he becomes a full loser). By comparison, if a new bidder bids on units after the BIN is executed, he will not be permitted to bid for more units than are available after the BIN.

Thus a method and system for providing an option to sell and buy at a pre-auction seller determined price in an Internet-based multi-unit auction facility have been described. Although the present invention has been described with reference to specific exemplary embodiments, it will be evident that various modifications and changes may be made to these embodiments without departing from the broader spirit and scope of the invention. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.

Claims (12)

What is claimed:

1. A computer-implemented method comprising:

presenting to a buyer, using a computer processor in a network-based transaction facility, a multi-unit auction;

permitting said buyer, via said computer processor, to bid one or more of a price and a number of units in said auction; and

permitting said buyer, via said computer processor, to re-bid in said auction;

wherein said auction comprises a rule that prevents said buyer from reducing the price in said re-bid; and

wherein said auction comprises a rule that prevents said buyer from reducing the number of units in said re-bid.

2. The computer-implemented method ofclaim 1, comprising modifying said rule that prevents said buyer from reducing the number of units in said re-bid such that said buyer is permitted to reduce the number of units in said re-bid when said buyer is not winning any units in said auction.

3. The computer-implemented method ofclaim 2, wherein said auction comprises a rule that prevents said buyer from reducing said number of units to less than one unit.

4. The computer-implemented method ofclaim 1, wherein said auction is an online auction.

5. A system comprising:

one or more computer processors in a network-based transaction facility that are configured to:

present a buyer a multi-unit auction;

permit said buyer to bid one or more of a price and a number of units in said auction; and

permit said buyer to re-bid in said auction;

wherein said auction comprises a rule that prevents said buyer from reducing the price in said re-bid; and

wherein said auction comprises a rule that prevents said buyer from reducing the number of units in said re-bid.

6. The system ofclaim 5, comprising a computer processor configured to modify said rule that prevents said buyer from reducing the number of units in said re-bid such that said buyer is permitted to reduce the number of units in said re-bid when said buyer is not winning any units in said auction.

7. The system ofclaim 6, wherein said auction comprises a rule that prevents said buyer from reducing said number of units to less than one unit.

8. The system ofclaim 5, wherein said auction is an online auction.

9. A machine-readable medium storing instructions, which, when executed by a processor, cause the processor to perform a process comprising:

presenting to a buyer a multi-unit auction;

permitting said buyer to bid one or more of a price and a number of units in said auction; and

permitting said buyer to re-bid in said auction;

wherein said auction comprises a rule that prevents said buyer from reducing the price in said re-bid; and

wherein said auction comprises a rule that prevents said buyer from reducing the number of units in said re-bid.

10. The machine-readable medium ofclaim 9, comprising instructions for modifying said rule that prevents said buyer from reducing the number of units in said re-bid such that said buyer is permitted to reduce the number of units in said re-bid when said buyer is not winning any units in said auction.

11. The machine-readable medium ofclaim 10, wherein said auction comprises a rule that prevents said buyer from reducing said number of units to less than one unit.

12. The machine-readable medium ofclaim 9, wherein said auction is an online auction.

Images