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

05/09/2018
by   Weiran Shen, et al.
0

Using AI approaches to automatically design mechanisms has been a central research mission at the interface of AI and economics [Conitzer and Sandholm, 2002]. Previous approaches that a empt to design revenue optimal auctions for the multi-dimensional settings fall short in at least one of the three aspects: 1) representation --- search in a space that probably does not even contain the optimal mechanism; 2) exactness --- finding a mechanism that is either not truthful or far from optimal; 3) domain dependence --- need a different design for different environment settings. To resolve the three difficulties, in this paper, we put forward a uni ed neural network based framework that automatically learns to design revenue optimal mechanisms. Our framework consists of a mechanism network that takes an input distribution for training and outputs a mechanism, as well as a buyer network that takes a mechanism as input and output an action. Such a separation in design mitigates the difficulty to impose incentive compatibility constraints on the mechanism, by making it a rational choice of the buyer. As a result, our framework easily overcomes the previously mentioned difficulty in incorporating IC constraints and always returns exactly incentive compatible mechanisms. We then applied our framework to a number of multi-item revenue optimal design settings, for a few of which the theoretically optimal mechanisms are unknown. We then go on to theoretically prove that the mechanisms found by our framework are indeed optimal.

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
11/06/2021

Computing Simple Mechanisms: Lift-and-Round over Marginal Reduced Forms

We study revenue maximization in multi-item multi-bidder auctions under ...
research
03/24/2020

Menu-size Complexity and Revenue Continuity of Buy-many Mechanisms

We study the multi-item mechanism design problem where a monopolist sell...
research
08/07/2018

The Sample Complexity of Up-to-ε Multi-Dimensional Revenue Maximization

We consider the sample complexity of revenue maximization for multiple b...
research
09/15/2019

Adversarial learning for revenue-maximizing auctions

We introduce a new numerical framework to learn optimal bidding strategi...
research
02/26/2022

Optimal-er Auctions through Attention

RegretNet is a recent breakthrough in the automated design of revenue-ma...
research
02/24/2023

Maximizing Miner Revenue in Transaction Fee Mechanism Design

Transaction fee mechanism design is a new decentralized mechanism design...

Please sign up or login with your details

Forgot password? Click here to reset