Pith. sign in

REVIEW

Neural Double Auction Mechanism

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 2412.11465 v1 pith:F35M7NHM submitted 2024-12-16 cs.GT

Neural Double Auction Mechanism

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

Mechanism design, a branch of economics, aims to design rules that can autonomously achieve desired outcomes in resource allocation and public decision making. The research on mechanism design using machine learning is called automated mechanism design or mechanism learning. In our research, we constructed a new network based on the existing method for single auctions and aimed to automatically design a mechanism by applying it to double auctions. In particular, we focused on the following four desirable properties for the mechanism: individual rationality, balanced budget, Pareto efficiency, and incentive compatibility. We conducted experiments assuming a small-scale double auction and clarified how deterministic the trade matching of the obtained mechanism is. We also confirmed how much the learnt mechanism satisfies the four properties compared to two representative protocols. As a result, we verified that the mechanism is more budget-balanced than the VCG protocol and more economically efficient than the MD protocol, with the incentive compatibility mostly guaranteed.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.