Deep Learning Meets Mechanism Design: Key Results and Some Novel Applications

• URL: http://arxiv.org/abs/2401.05683v1
• Date: Thu, 11 Jan 2024 06:09:32 GMT
• Title: Deep Learning Meets Mechanism Design: Key Results and Some Novel Applications
• Authors: V. Udaya Sankar, Vishisht Srihari Rao, Y. Narahari
• Abstract summary: We present, from relevant literature, technical details of using a deep learning approach for mechanism design. We demonstrate the power of this approach for three illustrative case studies.
• Score: 1.2661010067882734
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Mechanism design is essentially reverse engineering of games and involves inducing a game among strategic agents in a way that the induced game satisfies a set of desired properties in an equilibrium of the game. Desirable properties for a mechanism include incentive compatibility, individual rationality, welfare maximisation, revenue maximisation (or cost minimisation), fairness of allocation, etc. It is known from mechanism design theory that only certain strict subsets of these properties can be simultaneously satisfied exactly by any given mechanism. Often, the mechanisms required by real-world applications may need a subset of these properties that are theoretically impossible to be simultaneously satisfied. In such cases, a prominent recent approach is to use a deep learning based approach to learn a mechanism that approximately satisfies the required properties by minimizing a suitably defined loss function. In this paper, we present, from relevant literature, technical details of using a deep learning approach for mechanism design and provide an overview of key results in this topic. We demonstrate the power of this approach for three illustrative case studies: (a) efficient energy management in a vehicular network (b) resource allocation in a mobile network (c) designing a volume discount procurement auction for agricultural inputs. Section 6 concludes the paper.

Related papers

• Attention is Naturally Sparse with Gaussian Distributed Input [8.602260591839318]
  This study presents a rigorous theoretical analysis of the sparsity in attention scores within Large Language Models (LLMs) Our main contribution lies in providing a detailed theoretical examination of how sparsity manifests in attention mechanisms, offering insights into the potential trade-offs between computational savings and model effectiveness.
  arXiv  Detail & Related papers  (2024-04-03T12:37:34Z)
• Deep Generative Model-based Synthesis of Four-bar Linkage Mechanisms with Target Conditions [22.164394511786874]
  We propose a deep learning-based generative model for generating multiple crank-rocker four-bar linkage mechanisms. The proposed model is based on a conditional generative adversarial network (cGAN) with modifications for mechanism synthesis. The results demonstrate that the proposed model successfully generates multiple distinct mechanisms that satisfy specific kinematic and quasi-static requirements.
  arXiv  Detail & Related papers  (2024-02-22T03:31:00Z)
• Learning Payment-Free Resource Allocation Mechanisms [19.60309632660988]
  We consider the design of mechanisms that limited resources among self-interested agents using neural networks. We contribute a new end-to-end neural network architecture, ExS-Net, that accommodates the idea of "money-burning" for mechanism design without payments.
  arXiv  Detail & Related papers  (2023-11-18T01:21:54Z)
• Refined Mechanism Design for Approximately Structured Priors via Active Regression [50.71772232237571]
  We consider the problem of a revenue-maximizing seller with a large number of items for sale to $n$ strategic bidders. It is well-known that optimal and even approximately-optimal mechanisms for this setting are notoriously difficult to characterize or compute.
  arXiv  Detail & Related papers  (2023-10-11T20:34:17Z)
• Pessimism meets VCG: Learning Dynamic Mechanism Design via Offline Reinforcement Learning [114.36124979578896]
  We design a dynamic mechanism using offline reinforcement learning algorithms. Our algorithm is based on the pessimism principle and only requires a mild assumption on the coverage of the offline data set.
  arXiv  Detail & Related papers  (2022-05-05T05:44:26Z)
• Learning Dynamic Mechanisms in Unknown Environments: A Reinforcement Learning Approach [130.9259586568977]
  We propose novel learning algorithms to recover the dynamic Vickrey-Clarke-Grove (VCG) mechanism over multiple rounds of interaction. A key contribution of our approach is incorporating reward-free online Reinforcement Learning (RL) to aid exploration over a rich policy space.
  arXiv  Detail & Related papers  (2022-02-25T16:17:23Z)
• Properties from Mechanisms: An Equivariance Perspective on Identifiable Representation Learning [79.4957965474334]
  Key goal of unsupervised representation learning is "inverting" a data generating process to recover its latent properties. This paper asks, "Can we instead identify latent properties by leveraging knowledge of the mechanisms that govern their evolution?" We provide a complete characterization of the sources of non-identifiability as we vary knowledge about a set of possible mechanisms.
  arXiv  Detail & Related papers  (2021-10-29T14:04:08Z)
• Counterfactual Explanations as Interventions in Latent Space [62.997667081978825]
  Counterfactual explanations aim to provide to end users a set of features that need to be changed in order to achieve a desired outcome. Current approaches rarely take into account the feasibility of actions needed to achieve the proposed explanations. We present Counterfactual Explanations as Interventions in Latent Space (CEILS), a methodology to generate counterfactual explanations.
  arXiv  Detail & Related papers  (2021-06-14T20:48:48Z)
• Automated Mechanism Design for Classification with Partial Verification [64.69418921224529]
  We study the problem of automated mechanism design with partial verification. We focus on truthful mechanisms in the setting where all types share the same preference over outcomes.
  arXiv  Detail & Related papers  (2021-04-12T03:29: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.