摘要:
An improved system and method is provided for using sampling for scheduling advertisements in an online auction. A multi-armed bandit engine may be provided for learning the valuation of advertisements through sampling in an online advertising auction. To do so, the multi-armed bandit may schedule advertisements for web page placements in an online advertising auction to optimize payments for maximizing the welfare of the advertisers. An initial list of advertisements may be created that is ordered by expected payment, and an optimal subset of advertisements may be determined from the initial list of advertisements for web page placements by iterative sampling. A web page placement may then be determined and allocated for each advertisement in the optimal subset in order to maximize revenue. And a charge may be calculated for each advertisement allocated the web page placement and sampled in the online advertising auction.
摘要:
An improved system and method is provided for using sampling for scheduling advertisements in slots of different quality in an online auction with budget and time constraints. A multi-armed bandit engine may be provided for sampling new advertisements by allocating advertisements for web page placements of different quality and optimizing payments to maximize the welfare of the advertisers while remaining within advertiser's budget and time constraints. Advertisers may report their private information including arrival time, departure time, value per click, and budget. And the multi-armed bandit mechanism may approximate the maximal welfare that may be achieved under budget and time constraints by bounding the possible gain from any possible lie an advertiser might submit in reporting private information. Advertisers departing from the online auction may be charged using a payment method that may provide truthful guarantees on budget, arrivals, departures, and valuations for a budget-constrained online auction.
摘要:
A system is described for teaching users financial management using an online currency management system, including enabling an administrator to set up a financial account through a network. This step further includes assigning specific tasks for completion by one or more users, setting rules related to the management of play currency, and designating rewards that are earned by the one or more users through completion of the specific tasks. The system further includes providing a web-based interface for the one or more users to access and manage their own user account containing the play currency, and enabling the administrator to fund, with real currency, the purchase of the rewards by the one or more users with play currency.
摘要:
An improved system and method is provided for optimizing the reserve price and allocation of web page placements in an online keyword auction using generalized trade reduction. To do so, a generalized trade reduction engine may be provided to convert an implementation of an online keyword auction into a double-sided auction that may optimize the reserve price and allocation of web page placements to maximize revenue. An online keyword auction may be converted into a double-sided market by turning every bidder in the auction into a buyer and every web page placement into a virtual seller. The allocation of buyers and sellers may be divided into disjoint procurement sets and the generalized trade reduction engine may add or remove procurement sets in iterations until conditions of competition among remaining traders may be fulfilled to optimize the reserve price and allocation of web page placements to maximize revenue.
摘要:
An improved system and method is provided for making trading markets using generalized trade reduction. To do so, a trade reduction engine may be provided to turn the implementation of an individually rational and incentive-compatible mechanism of a market maker engine for single-valued traders making trades in a particular trading domain into an implementation of a budget balanced, individually rational and incentive-compatible mechanism that may bound the loss in social welfare. In general, the generalized trade reduction methods find procurement sets of traders and remove them in iterations until conditions of competition among remaining traders may be fulfilled for trading to occur. Advantageously, the present invention may support many applications for making trading markets using generalized trade reduction for both procurement-class domains and class domains.
摘要:
An improved system and method is provided for using sampling for scheduling advertisements in an online auction with budget and time constraints. A multi-armed bandit engine may be provided for sampling new advertisements by allocating advertisements for web page placements of equal quality and optimizing payments to maximize the welfare of the advertisers while remaining within advertiser's budget and time constraints. Advertisers may report their private information including arrival time, departure time, value per click, and budget. And the multi-armed bandit mechanism may approximate the maximal welfare that may be achieved under budget and time constraints by bounding the possible gain from any possible lie an advertiser might submit in reporting private information. Advertisers departing from the online auction may be charged using a payment method that may provide truthful guarantees on budget, arrivals, departures, and valuations for a budget-constrained online auction.
摘要:
An improved system and method is provided for using sampling for scheduling advertisements in an online auction with budget and time constraints. A multi-armed bandit engine may be provided for sampling new advertisements by allocating advertisements for web page placements of equal quality and optimizing payments to maximize the welfare of the advertisers while remaining within advertiser's budget and time constraints. Advertisers may report their private information including arrival time, departure time, value per click, and budget. And the multi-armed bandit mechanism may approximate the maximal welfare that may be achieved under budget and time constraints by bounding the possible gain from any possible lie an advertiser might submit in reporting private information. Advertisers departing from the online auction may be charged using a payment method that may provide truthful guarantees on budget, arrivals, departures, and valuations for a budget-constrained online auction.
摘要:
A system is described for teaching users financial management using an online currency management system, including enabling an administrator to set up a financial account through a network. This step further includes assigning specific tasks for completion by one or more users, setting rules related to the management of play currency, and designating rewards that are earned by the one or more users through completion of the specific tasks. The system further includes providing a web-based interface for the one or more users to access and manage their own user account containing the play currency, and enabling the administrator to fund, with real currency, the purchase of the rewards by the one or more users with play currency.
摘要:
An improved system and method is provided for using sampling for scheduling advertisements in an online auction with budget and time constraints. A multi-armed bandit engine may be provided for sampling new advertisements by allocating advertisements for web page placements of equal quality and optimizing payments to maximize the welfare of the advertisers while remaining within advertiser's budget and time constraints. Advertisers may report their private information including arrival time, departure time, value per click, and budget. And the multi-armed bandit mechanism may approximate the maximal welfare that may be achieved under budget and time constraints by bounding the possible gain from any possible lie an advertiser might submit in reporting private information. Advertisers departing from the online auction may be charged using a payment method that may provide truthful guarantees on budget, arrivals, departures, and valuations for a budget-constrained online auction.