A note on the efficiency of position mechanisms with budget constraints

04/25/2018
by   Alexandros A. Voudouris, et al.
0

We study the social efficiency of several well-known mechanisms for the allocation of a set of available (advertising) positions to a set of competing budget-constrained users (advertisers). Specifically, we focus on the Generalized Second Price auction (GSP), the Vickrey-Clarke-Groves mechanism (VCG) and the Expressive Generalized First Price auction (EGFP). Using the liquid welfare as our efficiency benchmark, we prove a tight bound of 2 on the liquid price of anarchy and stability of these mechanisms for pure Nash equilibria.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/28/2020

Simple combinatorial auctions with budget constraints

We study the efficiency of simple combinatorial auctions for the allocat...
research
03/31/2022

Budget-Constrained Auctions with Unassured Priors

In today's online advertising markets, it is common for an advertiser to...
research
08/04/2014

Computational Analysis of Perfect-Information Position Auctions

After experimentation with other designs, the major search engines conve...
research
06/06/2022

Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions

Internet ad auctions have evolved from a few lines of text to richer inf...
research
04/25/2018

Price of Anarchy for Mechanisms with Risk-Averse Agents

We study the price of anarchy of mechanisms in the presence of risk-aver...
research
05/18/2022

Budget Pacing in Repeated Auctions: Regret and Efficiency without Convergence

We study the aggregate welfare and individual regret guarantees of dynam...
research
01/30/2023

Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics

We study a game between autobidding algorithms that compete in an online...

Please sign up or login with your details

Forgot password? Click here to reset