A Scalable Neural Network for DSIC Affine Maximizer Auction Design
- URL: http://arxiv.org/abs/2305.12162v3
- Date: Wed, 17 Jan 2024 12:48:38 GMT
- Title: A Scalable Neural Network for DSIC Affine Maximizer Auction Design
- Authors: Zhijian Duan, Haoran Sun, Yurong Chen, Xiaotie Deng
- Abstract summary: AMenuNet is a scalable neural network that constructs the AMA parameters from bidder and item representations.
We conduct extensive experiments to demonstrate that AMenuNet outperforms strong baselines in both contextual and non-contextual multi-item auctions.
- Score: 20.177823187525107
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Automated auction design aims to find empirically high-revenue mechanisms
through machine learning. Existing works on multi item auction scenarios can be
roughly divided into RegretNet-like and affine maximizer auctions (AMAs)
approaches. However, the former cannot strictly ensure dominant strategy
incentive compatibility (DSIC), while the latter faces scalability issue due to
the large number of allocation candidates. To address these limitations, we
propose AMenuNet, a scalable neural network that constructs the AMA parameters
(even including the allocation menu) from bidder and item representations.
AMenuNet is always DSIC and individually rational (IR) due to the properties of
AMAs, and it enhances scalability by generating candidate allocations through a
neural network. Additionally, AMenuNet is permutation equivariant, and its
number of parameters is independent of auction scale. We conduct extensive
experiments to demonstrate that AMenuNet outperforms strong baselines in both
contextual and non-contextual multi-item auctions, scales well to larger
auctions, generalizes well to different settings, and identifies useful
deterministic allocations. Overall, our proposed approach offers an effective
solution to automated DSIC auction design, with improved scalability and strong
revenue performance in various settings.
Related papers
- Adaptive Slot Attention: Object Discovery with Dynamic Slot Number [64.45419820717754]
A major drawback of most object-centric models, including slot attention, is their reliance on predefining the number of slots.
Within this framework, we introduce an adaptive slot attention (AdaSlot) mechanism that dynamically determines the optimal number of slots.
Our framework, tested extensively on object discovery tasks with various datasets, shows performance matching or exceeding top fixed-slot models.
arXiv Detail & Related papers (2024-06-13T14:55:11Z) - GemNet: Menu-Based, Strategy-Proof Multi-Bidder Auctions Through Deep Learning [17.717553267684615]
GemNet learns auctions with better revenue than affine methods, achieves exact SP whereas previous general multi-bidder methods are approximately SP, and offers greatly enhanced interpretability.
Mixed-integer linear programs are used for menu transforms and through a number of optimizations, including adaptive grids and methods to skip menu elements, we scale to large auction design problems.
arXiv Detail & Related papers (2024-06-11T16:30:30Z) - Automated Deterministic Auction Design with Objective Decomposition [31.918952529696885]
This paper introduces OD-VVCA, an objective decomposition approach for automated designing Virtual Valuations Combinatorial Auctions (VVCAs)
We utilize a parallelizable dynamic programming algorithm to compute the allocation and revenue outcomes of a VVCA efficiently.
We then decompose the revenue objective function into continuous and piecewise constant discontinuous components, optimizing each using distinct methods.
arXiv Detail & Related papers (2024-02-19T07:45:04Z) - Exploiting Modality-Specific Features For Multi-Modal Manipulation
Detection And Grounding [54.49214267905562]
We construct a transformer-based framework for multi-modal manipulation detection and grounding tasks.
Our framework simultaneously explores modality-specific features while preserving the capability for multi-modal alignment.
We propose an implicit manipulation query (IMQ) that adaptively aggregates global contextual cues within each modality.
arXiv Detail & Related papers (2023-09-22T06:55:41Z) - STEERER: Resolving Scale Variations for Counting and Localization via
Selective Inheritance Learning [74.2343877907438]
Scale variation is a deep-rooted problem in object counting, which has not been effectively addressed by existing scale-aware algorithms.
We propose a novel method termed STEERER that addresses the issue of scale variations in object counting.
STEERER selects the most suitable scale for patch objects to boost feature extraction and only inherits discriminative features from lower to higher resolution progressively.
arXiv Detail & Related papers (2023-08-21T05:09:07Z) - Non-Separable Multi-Dimensional Network Flows for Visual Computing [62.50191141358778]
We propose a novel formalism for non-separable multi-dimensional network flows.
Since the flow is defined on a per-dimension basis, the maximizing flow automatically chooses the best matching feature dimensions.
As a proof of concept, we apply our formalism to the multi-object tracking problem and demonstrate that our approach outperforms scalar formulations on the MOT16 benchmark in terms of robustness to noise.
arXiv Detail & Related papers (2023-05-15T13:21:44Z) - Scalable Video Object Segmentation with Identification Mechanism [125.4229430216776]
This paper explores the challenges of achieving scalable and effective multi-object modeling for semi-supervised Video Object (VOS)
We present two innovative approaches, Associating Objects with Transformers (AOT) and Associating Objects with Scalable Transformers (AOST)
Our approaches surpass the state-of-the-art competitors and display exceptional efficiency and scalability consistently across all six benchmarks.
arXiv Detail & Related papers (2022-03-22T03:33:27Z) - A Context-Integrated Transformer-Based Neural Network for Auction Design [25.763612577196124]
One of the central problems in auction design is developing an incentive-compatible mechanism that maximizes the auctioneer's expected revenue.
We propose $mathttCITransNet$, a context-integrated transformer-based neural network for optimal auction design.
We show by extensive experiments that $mathttCITransNet$ can recover the known optimal solutions in single-item settings, outperform strong baselines in multi-item auctions, and generalize well to cases other than those in training.
arXiv Detail & Related papers (2022-01-29T03:47:00Z) - Embedded Self-Distillation in Compact Multi-Branch Ensemble Network for
Remote Sensing Scene Classification [17.321718779142817]
We propose a multi-branch ensemble network to enhance the feature representation ability.
We embed self-distillation (SD) method to transfer knowledge from ensemble network to main-branch in it.
Results prove that our proposed ESD-MBENet can achieve better accuracy than previous state-of-the-art (SOTA) complex models.
arXiv Detail & Related papers (2021-04-01T03:08:52Z) - A Fast Graph Neural Network-Based Method for Winner Determination in
Multi-Unit Combinatorial Auctions [44.14410999484577]
Auction (CA) is an efficient mechanism for resource allocation in different fields, including cloud computing.
The problem of allocating items among the bidders to maximize the auctioneers" revenue is NP-complete to solve and inapproximable.
We propose leveraging machine learning (ML) techniques to develop a novel low-complexity algorithm for solving this problem with negligible revenue loss.
arXiv Detail & Related papers (2020-09-29T00:22:37Z) - ResNeSt: Split-Attention Networks [86.25490825631763]
We present a modularized architecture, which applies the channel-wise attention on different network branches to leverage their success in capturing cross-feature interactions and learning diverse representations.
Our model, named ResNeSt, outperforms EfficientNet in accuracy and latency trade-off on image classification.
arXiv Detail & Related papers (2020-04-19T20:40:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.