English
Related papers

Related papers: Characterizing Optimal Adword Auctions

200 papers

Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been a lot of attention on the auction process and its game-theoretic aspects, our focus is on the advertisers. In particular,…

Data Structures and Algorithms · Computer Science 2007-05-23 Jon Feldman , S. Muthukrishnan , Martin Pal , Cliff Stein

Automated bidding, an emerging intelligent decision making paradigm powered by machine learning, has become popular in online advertising. Advertisers in automated bidding evaluate the cumulative utilities and have private financial…

Computer Science and Game Theory · Computer Science 2023-08-22 Yidan Xing , Zhilin Zhang , Zhenzhe Zheng , Chuan Yu , Jian Xu , Fan Wu , Guihai Chen

We present a deterministic exploration mechanism for sponsored search auctions, which enables the auctioneer to learn the relevance scores of advertisers, and allows advertisers to estimate the true value of clicks generated at the auction…

Computer Science and Game Theory · Computer Science 2011-11-10 Sudhir Kumar Singh , Vwani P. Roychowdhury , Milan Bradonjić , Behnam A. Rezaei

In mechanism design, it is challenging to design the optimal auction with correlated values in general settings. Although value distribution can be further exploited to improve revenue, the complex correlation structure makes it hard to…

Computer Science and Game Theory · Computer Science 2023-02-21 Da Huo , Zhilin Zhang , Zhenzhe Zheng , Chuan Yu , Jian Xu , Fan Wu

Many popular search engines run an auction to determine the placement of advertisements next to search results. Current auctions at Google and Yahoo! let advertisers specify a single amount as their bid in the auction. This bid is…

Computer Science and Game Theory · Computer Science 2007-05-23 Gagan Aggarwal , S. Muthukrishnan , Jon Feldman

We consider the "Offline Ad Slot Scheduling" problem, where advertisers must be scheduled to "sponsored search" slots during a given period of time. Advertisers specify a budget constraint, as well as a maximum cost per click, and may not…

Computer Science and Game Theory · Computer Science 2008-01-21 Jon Feldman , S. Muthukrishnan , Evdokia Nikolova , Martin Pal

Sponsored search becomes an easy platform to match potential consumers' intent with merchants' advertising. Advertisers express their willingness to pay for each keyword in terms of bids to the search engine. When a user's query matches the…

Computer Science and Game Theory · Computer Science 2012-07-20 Chenyang Li , Mingyi Hong , Randy Cogill , Alfredo Garcia

In a sponsored search auction the advertisement slots on a search result page are generally ordered by click-through rate. Bidders have a valuation, which is usually assumed to be linear in the click-through rate, a budget constraint, and…

Computer Science and Game Theory · Computer Science 2011-12-30 Riccardo Colini-Baldeschi , Monika Henzinger , Stefano Leonardi , Martin Starnberger

Internet search companies sell advertisement slots based on users' search queries via an auction. Advertisers have to determine how to place bids on the keywords of their interest in order to maximize their return for a given budget: this…

Data Structures and Algorithms · Computer Science 2007-09-24 S. Muthukrishnan , Martin Pal , Zoya Svitkina

Modern ad auctions allow advertisers to target more specific segments of the user population. Unfortunately, this is not always in the best interest of the ad platform. In this paper, we examine the following basic question in the context…

Computer Science and Game Theory · Computer Science 2019-07-16 Ashwinkumar Badanidiyuru , Kshipra Bhawalkar , Haifeng Xu

In the private values single object auction model, we construct a satisfactory mechanism - a symmetric, dominant strategy incentive compatible, and budget-balanced mechanism. Our mechanism allocates the object to the highest valued agent…

Computer Science and Game Theory · Computer Science 2016-10-04 Debasis Mishra , Tridib Sharma

Sponsored search auctions are commonly modeled as an assignment of a fixed set of slots (positions) to a set of advertisers, with welfare maximization being reducible to a standard matching problem. Motivated by modern ad formats, we study…

Computer Science and Game Theory · Computer Science 2026-05-13 Eleni Batziou , Georgios Birmpas , Georgios Chionas , Piotr Krysta

Auto-bidding plays an important role in online advertising and has become a crucial tool for advertisers and advertising platforms to meet their performance objectives and optimize the efficiency of ad delivery. Advertisers employing…

Computer Science and Game Theory · Computer Science 2020-12-07 Bin Li , Xiao Yang , Daren Sun , Zhi Ji , Zhen Jiang , Cong Han , Dong Hao

In many applications, ads are displayed together with the prices, so as to provide a direct comparison among similar products or services. The price-displaying feature not only influences the consumers' decisions, but also affects the…

Artificial Intelligence · Computer Science 2023-03-24 Bin Li , Yahui Lei

We study the problem of designing optimal auctions under restrictions on the set of permissible allocations. In addition to allowing us to restrict to deterministic mechanisms, we can also indirectly model non-additive valuations. We prove…

Computer Science and Game Theory · Computer Science 2016-06-07 Ian Kash , Rafael Frongillo

Many auction settings implicitly or explicitly require that bidders are treated equally ex-ante. This may be because discrimination is philosophically or legally impermissible, or because it is practically difficult to implement or…

Computer Science and Game Theory · Computer Science 2014-11-06 Christos Tzamos , Christopher A. Wilkens

In sponsored search, advertisement (abbreviated ad) slots are usually sold by a search engine to an advertiser through an auction mechanism in which advertisers bid on keywords. In theory, auction mechanisms have many desirable economic…

Computer Science and Game Theory · Computer Science 2015-12-11 Bowei Chen , Jun Wang , Ingemar J. Cox , Mohan S. Kankanhalli

In pay-per click sponsored search auctions which are currently extensively used by search engines, the auction for a keyword involves a certain number of advertisers (say k) competing for available slots (say m) to display their ads. This…

Computer Science and Game Theory · Computer Science 2010-01-17 Akash Das Sarma , Sujit Gujar , Y. Narahari

After experimentation with other designs, the major search engines converged on the weighted, generalized second-price auction (wGSP) for selling keyword advertisements. Notably, this convergence occurred before position auctions were well…

Computer Science and Game Theory · Computer Science 2014-08-05 David R. M Thompson , Kevin Leyton-Brown

The transition to auto-bidding in online advertising has shifted the focus of auction theory from quasi-linear utility maximization to value maximization subject to financial constraints. We study mechanism design for buyers with private…

Computer Science and Game Theory · Computer Science 2026-02-24 Xiaodong Liu , Weiran Shen , Zihe Wang
‹ Prev 1 2 3 10 Next ›