Multi-attribute auctioning method and system

• US 8,965,793 B2
• Filed: 03/23/2012
• Issued: 02/24/2015
• Est. Priority Date: 03/24/2011
• Status: Active Grant

• Current Assignee: Valorbec Societe En Commandite
• Original Assignee: Valorbec Societe En Commandite
• Inventors: Kersten, Gregory E., Wu, Shikui
• Primary Examiner(s): Huang, Tsan-Yu J
• Application Number:
  US13/428,888
• Publication Number:
  US 20120246020A1
• Time in Patent Office: 1,068 Days
• Field of Search: 705/26.3, 705/26.4
• US Class Current: 705/26.4
• CPC Class Codes: G06Q 30/0611 Request for offers or quotes
• CPC Class Codes: G06Q 30/08 Auctions

Abstract

A method and system for auctioning an auction item in a multi-attribute auction. A winning bid is selected by determining a secret value function indicative of acceptable combination of attribute values for the auction owner. The auction owner computing device or the auction server generates alternate combinations of attribute values based at least in part on the secret value function. To generate the alternate combinations of attribute values at least some of the combinations of attribute values are perturbed so as to hinder the bidders from deriving or finding the secret value function. The auction server informs the bidders, via a bidder interface of a client computing device, about the alternate combinations of attribute values and required biding directions. The bidder can offer a bid in a next round based on the alternate combinations of attribute values, in a progressive manner and without knowledge of the secret value function.

Claims

1. A method for auctioning an auction item in a multi-attribute auction in which bids are iteratively offered to an auction owner by a plurality of bidders, the method comprising:

determining a secret value function that is indicative of acceptable combination of attribute values for the auction owner to select a bid winner;

receiving a bid value for each of a plurality of attributes, the bid value being determined by the bidder without knowledge of the secret value function;

calculating in a processor a secret bid ranking for each bid value received according to the secret value function and determining at least a winning bid;

generating in a processor alternate combinations of attribute values that are based at least in part on the secret value function wherein at least some of the combinations of attribute values are perturbed to hinder the plurality of bidders from deriving the secret value function;

informing the plurality of bidders about the alternate combinations of attribute values for allowing them to offer in a next round a bid that is based on the alternate combinations of attribute values.

2. The method of claim 1, wherein the at least some of the combinations of attribute values are perturbed also to allow the auction to be progressive.

3. The method of claim 1, wherein the combinations of attribute values are perturbed at least in part by applying an increment function to the secret value function.

4. The method of claim 1, further comprising receiving an alternate bid ranking request for a proposed combination of attribute values, calculating an alternate bid ranking for the proposed combination of attribute values based on the alternate combinations of attribute values and sending the calculated alternate bid ranking.

5. The method of claim 1, wherein the alternate combinations of attribute values are also based on a best bid of a bidding round and the best bid is included in the alternate combinations of attributes.

6. The method of claim 1, further comprising maintaining the bid for a subsequent bidding round according to the generated alternate combinations.

7. The method of claim 1, further comprising receiving a bid value for each of the plurality of attributes, the bid value being determined by the bidder based on the alternate combinations of attribute values, without knowledge of the secret value function.

8. The method of claim 1, further comprising selecting a bid winner by comparing the bids received to the secret value function.

9. The method of claim 1, wherein the generating alternate combinations of attribute values is performed by a server computing device.

10. The method of claim 1, wherein the informing the plurality of bidders about the alternate combinations of attribute values through a bidder interface of a client computing device.

11. The method of claim 1, wherein the bids are iteratively offered to an auction owner through an auction owner interface of a client computing device by a plurality of bidders through the bidder interface of a client computing device.

12. The method of claim 1, wherein in a bidding round at least one of the plurality of bidders is required to bid for ending the bidding round according to a counter clock.

17. The method of claim 1, further comprising calculating an alternate bid ranking for each bid based on alternate combinations of attribute values and informing each bidder of the plurality of bidders about a best bid determined according to the alternate bid ranking.

18. The method of claim 1 further comprising receiving a bidder value function that is indicative of acceptable combination of attribute values for the bidder and determining a bid ranking of the best bid according to the bidder value function.

13. A multi-attribute auction system allowing bids to be iteratively offered to an auction owner by a plurality of bidders, the auction system comprising:

a processor;

a memory associated with said processor storing computer program instructions and configured to provide;

a value function calculator adapted to calculate a secret value function based on acceptable combinations of attribute values for the auction owner;

a bid collector adapted to receive a bid indicative of a combination of attribute values offered by the bidder without knowledge of the secret value function;

a ranking module adapted to compare each of the bids received with using the secret value function and determine at least a winning bid;

a value function perturbator adapted to generate alternate combinations of attribute values that are based at least in part on the secret value function wherein at least some of the combinations of attribute values are perturbed to hinder the plurality of bidders from deriving the secret value function; and

a guiding module adapted to send at least some of the alternate combinations of attribute values to each of the plurality of bidders.

14. The auction system of claim 13, further comprising a bidder value function calculator adapted to calculate a bidder value function based at least in part on acceptable combinations of attribute values for the bidder.

15. The auction system of claim 14, wherein the bidder value function calculator is adapted to calculate a bidder value function based also on the acceptable combinations of attribute values for the auction owner.

16. The auction system of claim 13, wherein the bidder value function calculator is adapted to calculate a bidder value function based also on the alternate combinations of attribute values.