Pith. sign in

REVIEW 2 cited by

Automated Mechanism Design via Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1805.03382 v2 pith:Z5NPOVXU submitted 2018-05-09 cs.AI cs.GT

classification cs.AIcs.GT
keywords optimaldesignmechanismmechanismsframeworknetworkneuralrevenue
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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 attempt 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 -- MenuNet -- a unified 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 apply 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. To the best of our knowledge, we are the first to apply neural networks to discover optimal auction mechanisms with provable optimality.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning Recommender Mechanisms for Bayesian Stochastic Games

    cs.GT 2025-05 conditional novelty 7.0 of 10

    ReMBo is the first learning-based recommender mechanism for Bayesian stochastic games; it returns policy recommendations with better truthfulness and participation incentives at welfare levels near cooperative MARL baselines.

  2. Deterministic-Allocation and Anonymous Joint Advertising in E-commerce Platforms

    cs.GT 2025-06 conditional novelty 6.0 of 10

    JTransNet is a transformer-based neural auction architecture that produces deterministic, anonymous, near-DSIC joint ad mechanisms and outperforms VCG, JAMA, and RegretNet on revenue in the paper's experiments.

Pith tools