Abstract: A method is disclosed for diminishing user advertisement fatigue to increase click efficiency, including receiving a search query or browsing action from a user; analyzing a plurality of advertisements available for delivery to a search results page in response to the search query or browsing action; arranging the plurality of advertisements in a queue so that, when delivered sequentially from the queue, no advertisement is viewable more than once on a search results page, to thereby reduce advertisement fatigue of the user; and delivering the queued plurality of advertisements sequentially to the search results pages of the user.

Abstract: Various embodiments of systems and methods for auctioning sponsored ads are provided. The auctioning systems and methods take hidden costs of sponsored ads into account. A user's future propensity to click on ads is influenced by his/her experience with past clicks. An ad with disappointing quality of landing page imposes a negative externality on the search engine and the future stream of revenue from a user is reduced. The externality may also be positive. A good experience with an ad may train users to pay more attention to other ads. The externality of an advertisement (ad) can be considered as a “hidden cost.” Including hidden costs of sponsored ads in the auctioning process promote (or encourage) ads with good quality and discourage (or penalize) ads with poor quality. By doing so, advertisers are likely to improve the quality of ads being placed in the bidding pool, which will result in improvement in the overall quality of sponsored ads. Users benefit from the higher quality ads.

Abstract: A method is disclosed for diminishing user advertisement fatigue to increase click efficiency, including receiving a search query or browsing action from a user; analyzing a plurality of advertisements available for delivery to a search results page in response to the search query or browsing action; arranging the plurality of advertisements in a queue so that, when delivered sequentially from the queue, no advertisement is viewable more than once on a search results page, to thereby reduce advertisement fatigue of the user; and delivering the queued plurality of advertisements sequentially to the search results pages of the user.

Abstract: An improved system and method for scheduling online keyword auctions over multiple time periods subject to budget constraints is provided. A linear programming model of slates of advertisements may be created for predicting the volume and order in which queries may appear throughout multiple time periods for use in allocating bidders to auctions to optimize revenue of an auctioneer. Each slate of advertisements may represent a candidate set of advertisements in order of optimal revenue to an auctioneer. Linear programming using column generation with the keyword as a constraint and a bidder's budget as a constraint may be applied for each time period to generate a column that may be added to a linear programming model of slates of advertisements. Upon receiving a query request, a slate of advertisements for the time period may be output for sending to a web browser for display.

Abstract: A procedure identifies multiple objects or processes to be monitored and identifies multiple devices to monitor the multiple objects or execute the multiple processes. The procedure continues by identifying multiple tasks to be executed by the multiple devices and predicting a trajectory for each of the multiple objects. A determination is made regarding which device should be executing each of the multiple tasks based on the predicted trajectory for each of the multiple objects.