Social Surplus Maximization in Sponsored Search Auctions Requires Communication

05/12/2023
by   Suat Evren, et al.
0

We show that computing the optimal social surplus requires Ω(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 model, even when bidders are allowed to freely communicate with each other.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2020

Communication memento: Memoryless communication complexity

We study the communication complexity of computing functions F:{0,1}^n×{...
research
08/24/2022

Sampling and Optimal Preference Elicitation in Simple Mechanisms

In this work we are concerned with the design of efficient mechanisms wh...
research
02/06/2018

The paradigm of complexity. Contributions for hypertext's formal approaches

This article argues for a return to formal approaches of hypertext and b...
research
10/12/2011

Auctions with Severely Bounded Communication

We study auctions with severe bounds on the communication allowed: each ...
research
05/19/2021

Calibrated Click-Through Auctions: An Information Design Approach

We analyze the optimal information design in a click-through auction wit...
research
06/15/2022

Discovery of the Content and Engagement with the Content

In the second half of the 20th century, Parliament allowed broadcasters ...

Please sign up or login with your details

Forgot password? Click here to reset