English
Related papers

Related papers: Individually-Fair Auctions for Multi-Slot Sponsore…

200 papers

Display advertising has traditionally been sold via guaranteed contracts -- a guaranteed contract is a deal between a publisher and an advertiser to allocate a certain number of impressions over a certain period, for a pre-specified price…

Multiagent Systems · Computer Science 2009-10-07 Arpita Ghosh , Preston McAfee , Kishore Papineni , Sergei Vassilvitskii

In billboard advertisement, a number of digital billboards are owned by an influence provider, and several commercial houses (which we call advertisers) approach the influence provider for a specific number of views of their advertisement…

Computer Science and Game Theory · Computer Science 2025-02-11 Dildar Ali , Suman Banerjee , Shweta Jain , Yamuna Prasad

In programmatic advertising, ad slots are usually sold using second-price (SP) auctions in real-time. The highest bidding advertiser wins but pays only the second-highest bid (known as the winning price). In SP, for a single item, the…

Machine Learning · Computer Science 2020-01-22 Aritra Ghosh , Saayan Mitra , Somdeb Sarkhel , Jason Xie , Gang Wu , Viswanathan Swaminathan

Auctions have been proposed as a way to provide economic incentives for primary users to dynamically allocate unused spectrum to other users in need of it. Previously proposed schemes do not take into account the fact that the power…

Computer Science and Game Theory · Computer Science 2014-12-24 Deepan Palguna , David J. Love , Ilya Pollak

Interactions between bids to show ads online can lead to an advertiser's ad being shown to more men than women even when the advertiser does not target towards men. We design bidding strategies that advertisers can use to avoid such…

Computer Science and Game Theory · Computer Science 2019-09-06 Milad Nasr , Michael Tschantz

We study the problem of fair online resource allocation via non-monetary mechanisms, where multiple agents repeatedly share a resource without monetary transfers. Previous work has shown that every agent can guarantee $1/2$ of their ideal…

Computer Science and Game Theory · Computer Science 2025-05-27 David X. Lin , Daniel Hall , Giannis Fikioris , Siddhartha Banerjee , Éva Tardos

In cloud investment markets, consumers are looking for the lowest cost and a desirable fairness while providers are looking for strategies to achieve the highest possible profit and return. Most existing models for auction-based resource…

Computer Science and Game Theory · Computer Science 2016-09-22 Reihaneh Hassanzadeh , Ali Movaghar , Hamid Reza Hassanzadeh

In online advertising markets, budget-constrained advertisers acquire ad placements through repeated bidding in auctions on various platforms. We present a strategy for bidding optimally in a set of auctions that may or may not be…

Computer Science and Game Theory · Computer Science 2023-06-14 Fransisca Susan , Negin Golrezaei , Okke Schrijvers

The design of the best economic mechanism for Sponsored Search Auctions (SSAs) is a central task in computational mechanism design/game theory. Two open questions concern the adoption of user models more accurate than that one currently…

Computer Science and Game Theory · Computer Science 2015-11-24 Gabriele Farina , Nicola Gatti

Cross-Modal sponsored search displays multi-modal advertisements (ads) when consumers look for desired products by natural language queries in search engines. Since multi-modal ads bring complementary details for query-ads matching, the…

Computer Vision and Pattern Recognition · Computer Science 2023-09-29 Yuanmin Tang , Jing Yu , Keke Gai , Yujing Wang , Yue Hu , Gang Xiong , Qi Wu

Since 2019, most ad exchanges and sell-side platforms (SSPs), in the online advertising industry, shifted from second to first price auctions. Due to the fundamental difference between these auctions, demand-side platforms (DSPs) have had…

Internet ad auctions have evolved from a few lines of text to richer informational layouts that include images, sitelinks, videos, etc. Ads in these new formats occupy varying amounts of space, and an advertiser can provide multiple…

Computer Science and Game Theory · Computer Science 2022-06-08 Gagan Aggarwal , Kshipra Bhawalkar , Aranyak Mehta , Divyarthi Mohan , Alexandros Psomas

We consider auctions with N+1 bidders. Of these, N are symmetric and N+1 is "sufficiently strong" relative to the others. The auction is a "tournament" in which the first N players bid to win the right to compete with N+1. The bids of the…

Theoretical Economics · Economics 2024-09-18 Luca Anderlini , GaOn Kim

Standard ad auction formats do not immediately extend to settings where multiple size configurations and layouts are available to advertisers. In these settings, the sale of web advertising space increasingly resembles a combinatorial…

Computer Science and Game Theory · Computer Science 2020-11-10 Rad Niazadeh , Jason Hartline , Nicole Immorlica , Mohammad Reza Khani , Brendan Lucier

In many online advertisement (ad) exchanges, ad slots are each sold via a separate second-price auction. This paper considers the bidder's problem of maximizing the value of ads they purchase in these auctions, subject to budget…

Computer Science and Game Theory · Computer Science 2020-03-16 Jonathan Amar , Nicholas Renegar

Auto-bidding has recently become a popular feature in ad auctions. This feature enables advertisers to simply provide high-level constraints and goals to an automated agent, which optimizes their auction bids on their behalf. In this paper,…

Theoretical Economics · Economics 2024-05-15 Yeganeh Alimohammadi , Aranyak Mehta , Andres Perlroth

We show that computing the optimal social surplus requires $\Omega(mn)$ bits of communication between the website and the bidders in a sponsored search auction with $n$ slots on the website and with tick size of $2^{-m}$ in the discrete…

Computer Science and Game Theory · Computer Science 2023-05-16 Suat Evren

Advertising becomes one of the most popular ways of monetizing an online transaction platform. Usually, sponsored advertisements are posted on the most attractive positions to enhance the number of clicks. However, multiple e-commerce…

Computer Science and Game Theory · Computer Science 2022-04-22 Weian Li , Qi Qi , Changjun Wang , Changyuan Yu

In the Bidder Selection Problem (BSP) there is a large pool of $n$ potential advertisers competing for ad slots on the user's web page. Due to strict computational restrictions, the advertising platform can run a proper auction only for a…

Computer Science and Game Theory · Computer Science 2024-04-30 Nickolai Gravin , Yixuan Even Xu , Renfei Zhou

The standard framework of online bidding algorithm design assumes that the seller commits himself to faithfully implementing the rules of the adopted auction. However, the seller may attempt to cheat in execution to increase his revenue if…

Computer Science and Game Theory · Computer Science 2023-11-28 Qian Wang , Xuanzhi Xia , Zongjun Yang , Xiaotie Deng , Yuqing Kong , Zhilin Zhang , Liang Wang , Chuan Yu , Jian Xu , Bo Zheng
‹ Prev 1 3 4 5 6 7 10 Next ›