Data Processing System That Provides An Auction With Programmable Proxy Bids

Abstract

In the context of computer-based auctions, innovations in proxy bids and auction formats are disclosed. In accordance with the illustrative embodiment, a bidder can program a data processing system to enter one or more bids by proxy. The capabilities offered by the data processing system include: determining one or more bid variables based, at least in part, on the identity of one or more bidders in an auction, or determining one or more bid variables based, at least in part, on the absence of one or more bidders from an auction, or determining one or more bid variables based, at least in part, on the bid variables in one or more other bids, or determining one or more bid variables based, at least in part, on the results of another auction, or determining one or more bid variables based, at least in part, on default values, or waiting a specific or random amount of time before entering a bid in behalf of a bidder, or any combination of these.

1 . A method of conducting an auction in behalf of an auction solicitor and for a scope, the method comprising: 
 entering, at the data processing system, a first plurality of bids into the auction, wherein each of the first plurality of bids is for a portion of the scope as partitioned in a first dimension, and wherein the first plurality of bids in aggregate is for all of the scope;    entering, at the data processing system, a second plurality of bids into the auction, wherein each of the second plurality of bids is for a portion of the scope as partitioned in a second dimension, and wherein the second plurality of bids in aggregate is for all of the scope;    outputting from the data processing system an indicium of which of (i) the first plurality of bids and (ii) the second plurality of bids is most advantageous to the auction solicitor.    
   
   
       2 . The method of  claim 1  further comprising: 
 entering, at a data processing system, a first bid into the auction, wherein the first bid is for all of the scope; and    outputting from the data processing system an indicium of which of (i) the first plurality of bids, (ii) the second plurality of bids, and (iii) the first bid is most advantageous to the auction solicitor.    
   
   
       3 . The method of  claim 1  wherein the first plurality of bids is submitted by a first plurality of bidders that comprise a first bidder and a second bidder; and 
 wherein the second plurality of bids is submitted by a second plurality of bidders that comprise a third bidder and a fourth bidder.    
   
   
       4 . The method of  claim 1  wherein the first plurality of bids is submitted by a first plurality of bidders that comprise a first bidder and a second bidder; and 
 wherein the second plurality of bids is submitted by a second plurality of bidders that comprise the second bidder and a third bidder.    
   
   
       5 . A method of conducting a sealed-bid auction in behalf of an auction solicitor, which sealed-bid auction comprises a bidding phase and a resolution phase, the method comprising: 
 entering, at a data processing system and during the bidding phase, a first plurality of sealed bids into the auction, wherein each of the first plurality of bids is for a portion of the scope as partitioned in a first dimension and the first plurality of bids in aggregate is for all of the scope;    entering, at the data processing system and during the bidding phase, a second plurality of sealed bids into the auction, wherein each of the second plurality of bids is for a portion of the scope as partitioned in a second dimension and the second plurality of bids in aggregate is for all of the scope; and    outputting, from the data processing system and before the resolution phase, the ranking of the advantageousness of the first plurality of sealed bids and the second plurality of sealed bids to the auction solicitor.    
   
   
       6 . The method of  claim 5  further comprising entering, at the data processing system and during the bidding phase, a revised first sealed bid into the sealed-bid auction in behalf of the first bidder.  
   
   
       7 . The method of  claim 5  further comprising withholding, at the data processing system, the contents of the second sealed bid from the first bidder until the resolution phase.  
   
   
       8 . The method of claim of  5  wherein the ranking is ordinal.  
   
   
       9 . A method comprising: 
 entering, at a data processing system, a first bid into a first auction in behalf of a first bidder;    receiving, at the data processing system, a bid package that directs the data processing system to prepare, after the first auction is completed, a second bid for a second auction, wherein the second bid is based, at least in part, on whether the first bidder has won the first auction or not won the first auction;    determining, at the data processing system, whether the first bidder has won the first auction or not won the first auction;    preparing, at the data processing system, the second bid based, at least in part, on whether the first bidder has won the first auction or not won the first auction;    entering, at the data processing system, the second bid into the second auction in behalf of the first bidder; and    determining, at the data processing system, whether the first bidder has won the second auction or not won the second auction.    
   
   
       10 . The method of  claim 9  wherein the first bid is for all of the scope of the first auction; and 
 wherein the second bid is for all of the scope of the second auction.    
   
   
       11 . The method of  claim 9  wherein the first bid is for a portion of the scope of the first auction; and 
 wherein the second bid is for a portion of the scope of the second auction.    
   
   
       12 . The method of  claim 9  wherein the first bid is for a portion of the scope of the first auction; and 
 wherein the second bid is for all of the scope of the second auction.    
   
   
       13 . The method of  claim 9  wherein the first bid is for all of the scope of the first auction; and 
 wherein the second bid is for a portion of the scope of the second auction.