Side-by-side first-price auctions with imperfect bidders

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Heymann, Benjamin
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866918231711678464
author Heymann, Benjamin
author_facet Heymann, Benjamin
contents We model a procurement scenario in which two \textit{imperfect} bidders act simultaneously on behalf of a single buyer, a configuration common in display advertising and referred to as \textit{side-by-side bidding} but largely unexplored in theory. We prove that the iterated best response algorithm converges to an equilibrium under standard distributional assumptions and provide sufficient condition for uniqueness. Beyond establishing existence and convergence, our analysis provides a tractable numerical method for quantitative studies of side-by-side procurement.
format Preprint
id arxiv_https___arxiv_org_abs_2512_04850
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Side-by-side first-price auctions with imperfect bidders
Heymann, Benjamin
Computer Science and Game Theory
Theoretical Economics
Optimization and Control
We model a procurement scenario in which two \textit{imperfect} bidders act simultaneously on behalf of a single buyer, a configuration common in display advertising and referred to as \textit{side-by-side bidding} but largely unexplored in theory. We prove that the iterated best response algorithm converges to an equilibrium under standard distributional assumptions and provide sufficient condition for uniqueness. Beyond establishing existence and convergence, our analysis provides a tractable numerical method for quantitative studies of side-by-side procurement.
title Side-by-side first-price auctions with imperfect bidders
topic Computer Science and Game Theory
Theoretical Economics
Optimization and Control
url https://arxiv.org/abs/2512.04850