Optimal-er Auctions through Attention

02/26/2022
by   Dmitry Ivanov, et al.
0

RegretNet is a recent breakthrough in the automated design of revenue-maximizing auctions. It combines the expressivity of deep learning with the regret-based approach to relax and quantify the Incentive Compatibility constraint (that participants benefit from bidding truthfully). We propose two independent modifications of RegretNet, namely a new neural architecture based on the attention mechanism, denoted as RegretFormer, and an alternative loss function that is interpretable and significantly less sensitive to hyperparameters. We investigate both proposed modifications in an extensive experimental study in settings with fixed and varied input sizes and additionally test out-of-setting generalization of our network. In all experiments, we find that RegretFormer consistently outperforms existing architectures in revenue. Regarding our loss modification, we confirm its effectiveness at controlling the revenue-regret trade-off by varying a single interpretable hyperparameter.

READ FULL TEXT
research
06/15/2021

Learning Revenue-Maximizing Auctions With Differentiable Matching

We propose a new architecture to approximately learn incentive compatibl...
research
06/15/2020

Certifying Strategyproof Auction Networks

Optimal auctions maximize a seller's expected revenue subject to individ...
research
02/24/2023

Maximizing Miner Revenue in Transaction Fee Mechanism Design

Transaction fee mechanism design is a new decentralized mechanism design...
research
05/09/2018

Computer-aided mechanism design: designing revenue-optimal mechanisms via neural networks

Using AI approaches to automatically design mechanisms has been a centra...
research
03/01/2018

Robust Repeated Auctions under Heterogeneous Buyer Behavior

We study revenue optimization in a repeated auction between a single sel...
research
06/07/2019

Dynamic First Price Auctions Robust to Heterogeneous Buyers

We study dynamic mechanisms for optimizing revenue in repeated auctions,...
research
02/13/2016

Conservative Bandits

We study a novel multi-armed bandit problem that models the challenge fa...

Please sign up or login with your details

Forgot password? Click here to reset