Bidding in online auctions

1. A method executed by a computer, comprising:

receiving, at a computer, bids for advertising at an online search auction;

calculating, by the computer, an amount to bid for the advertising, the amount equal to an expected value-per-click divided by a value of a function of a fraction of a budget already spent for advertising on previous bids at the online search auction; and

displaying, at a computer, advertisements in winning ad slots.

2. The method of claim 1 further comprising, placing a bid only when a highest bid among current bidders for the advertising is less than the expected value-per- click.

3. The method of claim 1 , wherein an efficiency of each ad slot has an upper bound based on the expected value-per-click divided by a search engine minimum fee charge for receiving a slot to advertise.

4. The method of claim 1 further comprising, calculating an optimal amount of money to bid for the advertising based on a multiple-choice knapsack problem modeling of ad slots over time periods.

5. The method of claim 1 further comprising, modeling of a multiple-choice knapsack problem based on one of maximizing a total revenue of an advertiser over time, maximizing a total profit of the advertiser, or a total number of impressions.

6. The method of claim 1 further comprising:

modeling an online trading process of goods or services, wherein a trader has a budget constraint as an online knapsack problem;

solving a online trading problem using an algorithm developed for the online knapsack problem.

7. The method of claim 1 further comprising:

determining an optimal amount of money to bid for the advertising slot without having knowledge of other bids and click-through rates for advertising slots.

8. The method of claim 1 further comprising:

receiving keywords for a search query;

assessing the keywords to determine how much to bid for an advertising slot in order to maximize a return on investment for the search query.

9. A non-transitory computer-readable medium having computer-readable program code embodied therein which when executed by a computer causes the computer to perform the following steps:

receiving bids for advertising slots for a network search query;

bidding for one of the advertising slots an amount of money that is an expected value-per-click divided by an exponential function of a fraction of a budget already spent for previous advertising slots;

displaying advertisements of bidders.

10. The non-transitory computer-readable medium of claim 9 , wherein the code further causes the computer to perform:

calculating when a maximum bid amount for the advertising slots is greater than the expected value-per-click.

11. The non-transitory computer-readable medium of claim 9 , wherein the code further causes the computer to perform:

determining the amount of money to bid based on profit for winning the one of the advertising slots divided by a cost to win the one of the advertising slots.

12. The non-transitory computer-readable medium of claim 9 , wherein the amount of money depends only on a value of keywords submitted for the network search query and the fraction of the budget already spent.

13. The non-transitory computer-readable medium of claim 9 , wherein the code further causes the computer to perform:

determining an optimal amount to bid for the one of the advertising slots without utilizing information pertaining to (1) amounts of other bids received for the one of the advertising slots and (2) how frequently network search queries occur.

14. The non-transitory computer-readable medium of claim 9 , wherein each of the advertising slots has a click-through rate that is defined as an expected number of clicks on an advertisement divided by a total number of impressions.

15. A computer system, comprising:

memory storing an algorithm;

processor to execute the algorithm to:

examine bids for advertising slots for a keyword search;

submit a bid amount for the advertising slots, the bid amount being a function of an expected value-per-click divided by a value of an exponential function of a fraction of a budget already spent;

allocate the advertising slots to bidders.

16. The computer system of claim 15 , wherein the bid amount depends only on a value of keywords for the keyword search and the fraction of the budget already spent.

17. The computer system of claim 15 wherein the processor further executes the algorithm to:

place a bid only when a highest bid among current bidders for the advertising slots are less than the expected value-per-click.

18. The computer system of claim 15 wherein the processor further executes the algorithm to:

calculate an optimal amount of money to bid for one of the advertising slots without utilizing information of other bids and click-through rates for the advertising slots.

19. The computer system of claim 15 wherein the processor further executes the algorithm to:

calculate an amount to bid for one of the advertising slots in order to maximize a return on money budgeted for advertising at online auctions.

20. The computer system of claim 15 wherein the processor further executes the algorithm to:

calculate an amount of money to bid based on profit for winning one of the advertising slots divided by a cost to win the one of the advertising slots.

21. The computer system of claim 15 wherein the processor further executes the algorithm to:

calculate an optimal amount to bid for the advertising slots without utilizing information pertaining to a frequency of how often search queries are executed.

22. The computer system of claim 15 , wherein each of the advertising slots has a click-through rate defined as an expected number of clicks on an ad divided by a total number of displays.