GemNet: Menu-Based, Strategy-Proof Multi-Bidder Auctions Through Deep Learning
- URL: http://arxiv.org/abs/2406.07428v1
- Date: Tue, 11 Jun 2024 16:30:30 GMT
- Title: GemNet: Menu-Based, Strategy-Proof Multi-Bidder Auctions Through Deep Learning
- Authors: Tonghan Wang, Yanchen Jiang, David C. Parkes,
- Abstract summary: 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.
- Score: 17.717553267684615
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Differentiable economics uses deep learning for automated mechanism design. Despite strong progress, it has remained an open problem to learn multi-bidder, general, and fully strategy-proof (SP) auctions. We introduce GEneral Menu-based NETwork (GemNet), which significantly extends the menu-based approach of RochetNet [D\"utting et al., 2023] to the multi-bidder setting. The challenge in achieving SP is to learn bidder-independent menus that are feasible, so that the optimal menu choices for each bidder do not over-allocate items when taken together (we call this menu compatibility). GemNet penalizes the failure of menu compatibility during training, and transforms learned menus after training through price changes, by considering a set of discretized bidder values and reasoning about Lipschitz smoothness to guarantee menu compatibility on the entire value space. This approach is general, leaving undisturbed trained menus that already satisfy menu compatibility and reducing to RochetNet for a single bidder. 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. GemNet learns auctions with better revenue than affine maximization methods, achieves exact SP whereas previous general multi-bidder methods are approximately SP, and offers greatly enhanced interpretability.
Related papers
- RoDE: Linear Rectified Mixture of Diverse Experts for Food Large Multi-Modal Models [96.43285670458803]
Uni-Food is a unified food dataset that comprises over 100,000 images with various food labels.
Uni-Food is designed to provide a more holistic approach to food data analysis.
We introduce a novel Linear Rectification Mixture of Diverse Experts (RoDE) approach to address the inherent challenges of food-related multitasking.
arXiv Detail & Related papers (2024-07-17T16:49:34Z) - FoodLMM: A Versatile Food Assistant using Large Multi-modal Model [96.76271649854542]
Large Multi-modal Models (LMMs) have made impressive progress in many vision-language tasks.
This paper proposes FoodLMM, a versatile food assistant based on LMMs with various capabilities.
We introduce a series of novel task-specific tokens and heads, enabling the model to predict food nutritional values and multiple segmentation masks.
arXiv Detail & Related papers (2023-12-22T11:56:22Z) - 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) - A Scalable Neural Network for DSIC Affine Maximizer Auction Design [20.177823187525107]
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.
arXiv Detail & Related papers (2023-05-20T10:42:00Z) - MenuAI: Restaurant Food Recommendation System via a Transformer-based
Deep Learning Model [15.248362664235845]
A novel restaurant food recommendation system is proposed in this paper.
It uses Optical Character Recognition (OCR) technology and a transformer-based deep learning model, Learning to Rank (LTR) model.
Our system is able to rank the food dishes in terms of the input search key (e.g., calorie, protein level)
arXiv Detail & Related papers (2022-10-15T11:45:44Z) - Diversified Recommendations for Agents with Adaptive Preferences [9.578114969867258]
We consider a problem where an Agent visits a platform recommending a menu of content to select from, their choice of item depends not only on fixed preferences, but also on their prior engagements with the platform.
The Recommender presents a menu of $k$ items to the Agent, who selects one item in the menu according to their unknown preference model.
The Recommender then observes the Agent's chosen item and receives bandit feedback of the item's reward.
In addition to optimizing reward from selected items, the Recommender must also ensure that the total distribution of chosen items has sufficiently high entropy.
arXiv Detail & Related papers (2022-09-20T16:12:22Z) - Cluttered Food Grasping with Adaptive Fingers and Synthetic-Data Trained
Object Detection [8.218146534971156]
Food packaging industry handles an immense variety of food products with wide-ranging shapes and sizes.
A popular approach to bin-picking is to first identify each piece of food in the tray by using an instance segmentation method.
We propose a method that trains purely on synthetic data and successfully transfers to the real world using sim2real methods.
arXiv Detail & Related papers (2022-03-10T06:44:09Z) - Learning Salient Boundary Feature for Anchor-free Temporal Action
Localization [81.55295042558409]
Temporal action localization is an important yet challenging task in video understanding.
We propose the first purely anchor-free temporal localization method.
Our model includes (i) an end-to-end trainable basic predictor, (ii) a saliency-based refinement module, and (iii) several consistency constraints.
arXiv Detail & Related papers (2021-03-24T12:28:32Z) - A Recipe for Creating Multimodal Aligned Datasets for Sequential Tasks [48.39191088844315]
In the cooking domain, the web offers many partially-overlapping text and video recipes that describe how to make the same dish.
We use an unsupervised alignment algorithm that learns pairwise alignments between instructions of different recipes for the same dish.
We then use a graph algorithm to derive a joint alignment between multiple text and multiple video recipes for the same dish.
arXiv Detail & Related papers (2020-05-19T17:27:00Z) - SetRank: A Setwise Bayesian Approach for Collaborative Ranking from
Implicit Feedback [50.13745601531148]
We propose a novel setwise Bayesian approach for collaborative ranking, namely SetRank, to accommodate the characteristics of implicit feedback in recommender system.
Specifically, SetRank aims at maximizing the posterior probability of novel setwise preference comparisons.
We also present the theoretical analysis of SetRank to show that the bound of excess risk can be proportional to $sqrtM/N$.
arXiv Detail & Related papers (2020-02-23T06:40:48Z)
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.