Automated Mechanism - Explore the Science & Experts | ideXlab



Scan Science and Technology

Contact Leading Edge Experts & Companies

Automated Mechanism

The Experts below are selected from a list of 23829 Experts worldwide ranked by ideXlab platform

Automated Mechanism – Free Register to Access Experts & Abstracts

Makoto Yokoo – One of the best experts on this subject based on the ideXlab platform.

  • sat based Automated Mechanism design for false name proof facility location
    Pacific Rim International Conference on Multi-Agents, 2019
    Co-Authors: Nodoka Okada, Taiki Todo, Makoto Yokoo

    Abstract:

    In the literature of Mechanism design, market Mechanisms have been developed by professionals based on their experience. The concept of Automated Mechanism design (AMD), initiated by Sandholm (2002), is a ground-breaking computer-aided framework to develop market Mechanisms. In this paper, we apply a very recent AMD approach based on Boolean Satisfiability (SAT) to the Mechanism design of false-name-proof facility location. We first provide a general theoretical characteristic of false-name-proof Mechanisms, which enables a quite compact representation of target Mechanisms. Our approach successfully reproduces several known results in the literature on false-name-proof facility locations over discrete structures. Furthermore, some unknown Mechanisms are discovered for locating a public good on a 2-by-2 grid, and an impossibility result is revealed for locating a public bad, with an additional mild assumption, on a 2-by-3 grid. Finally, we demonstrate the extendability of our approach, by providing a new false-name-proof Mechanism for a slightly modified problem of locating a public good.

    Free Register to Access Article

  • PRIMA – SAT-Based Automated Mechanism Design for False-Name-Proof Facility Location
    PRIMA 2019: Principles and Practice of Multi-Agent Systems, 2019
    Co-Authors: Nodoka Okada, Taiki Todo, Makoto Yokoo

    Abstract:

    In the literature of Mechanism design, market Mechanisms have been developed by professionals based on their experience. The concept of Automated Mechanism design (AMD), initiated by Sandholm (2002), is a ground-breaking computer-aided framework to develop market Mechanisms. In this paper, we apply a very recent AMD approach based on Boolean Satisfiability (SAT) to the Mechanism design of false-name-proof facility location. We first provide a general theoretical characteristic of false-name-proof Mechanisms, which enables a quite compact representation of target Mechanisms. Our approach successfully reproduces several known results in the literature on false-name-proof facility locations over discrete structures. Furthermore, some unknown Mechanisms are discovered for locating a public good on a 2-by-2 grid, and an impossibility result is revealed for locating a public bad, with an additional mild assumption, on a 2-by-3 grid. Finally, we demonstrate the extendability of our approach, by providing a new false-name-proof Mechanism for a slightly modified problem of locating a public good.

    Free Register to Access Article

  • AAMAS – Social Decision with Minimal Efficiency Loss: An Automated Mechanism Design Approach
    , 2015
    Co-Authors: Mingyu Guo, Hong Shen, Taiki Todo, Yuko Sakurai, Makoto Yokoo

    Abstract:

    We study the problem where a group of agents need to choose from a finite set of social outcomes. We assume every agent’s valuation for every outcome is bounded and the bounds are public information. For our model, no Mechanism simultaneously satisfies strategy-proofness, individual rationality, non-deficit, and efficiency. In light of this, we aim to design Mechanisms that are strategy-proof, individually rational, non-deficit, and minimize the worst-case efficiency loss.

    We propose a family of Mechanisms called the shifted Groves Mechanisms, which are generalizations of the Groves Mechanisms. We first show that if there exist Mechanisms that are strategy-proof, individually rational, and non-deficit, then there exist shifted Groves Mechanisms with these properties. Our main result is an Automated Mechanism Design (AMD) approach for identifying the (unique) optimal shifted Groves Mechanism, which minimizes the worst-case efficiency loss among all shifted Groves Mechanisms. Finally, we prove that the optimal shifted Groves Mechanism is globally optimal among all deterministic Mechanisms that are strategy-proof, individually rational, and non-deficit.

    Free Register to Access Article

Linda J. Broadbelt – One of the best experts on this subject based on the ideXlab platform.

  • Reactive Flow Simulation Based on the Integration of Automated Mechanism Generation and On-the-Fly Reduction
    Energy & Fuels, 2014
    Co-Authors: Shuliang Zhang, Linda J. Broadbelt, Ioannis P. Androulakis, Marianthi G. Ierapetritou

    Abstract:

    A novel computational framework that enables reactive flow simulation without using an a priori reaction Mechanism is proposed in this work. The proposed computational framework is based on the integration of Automated Mechanism generation and on-the-fly reduction based on element flux analysis. Stepwise implementation of the integrated framework is developed to perform reactive flow simulations. The computational framework starts the simulation without any prior knowledge of the Mechanism with only fuel and air as the initial species and performs the stepwise Mechanism generation and on-the-fly reduction iteratively to obtain the entire simulation results. In each local computation step, a Mechanism is generated automatically starting with the reduced Mechanism at the end of the previous step, and flux-based on-the-fly reduction is applied to the generated Mechanism to obtain reactive flow simulation results for the current step. The reduced Mechanism at the end of the current step is then used as the st…

    Free Register to Access Article

  • Automated Mechanism generation. Part 2: application to atmospheric chemistry of alkanes and oxygenates
    Journal of Atmospheric Chemistry, 2009
    Co-Authors: Shumaila S. Khan, Linda J. Broadbelt

    Abstract:

    In this study, an Automated Mechanism generation framework was applied to atmospheric chemistry of volatile organic compounds (VOCs) and nitrogen oxides (NO_ x ). The framework generates reactions with minimal input based on a small set of reaction operators and includes a hierarchy for specifying rate constants for every reaction created. Mechanisms were generated for formaldehyde-air-NO_ x , acetaldehyde-formaldehyde- n -octane-air-NO_ x , and acetone-air-NO_ x , and the model results were compared to experimental data obtained from smog chambers and to the SAPRC-99 lumped models. The models generated captured the experimental data very well, and their mechanistic formulation provided new insights into the controlling reaction pathways to pollutant formation. The approach applied here is sufficiently general that it can be applied to a wide range of alkane and oxygenate mixtures.

    Free Register to Access Article

  • Automated Mechanism generation. Part 1: Mechanism development and rate constant estimation for VOC chemistry in the atmosphere
    Journal of Atmospheric Chemistry, 2009
    Co-Authors: Shumaila S. Khan, Qizhi Zhang, Linda J. Broadbelt

    Abstract:

    A framework for Automated Mechanism generation for modeling atmospheric chemistry at the mechanistic level was developed. In part 1, categorization of reactions into reaction families and determination of rate coefficients using a hierarchical approach that uses experimental data and kinetic correlations are described. The main focus was to develop kinetic correlations for estimating rate coefficients that are not available experimentally, and the main correlation used was the Evans–Polanyi relationship that relates the activation energy to the heat of reaction. A hierarchical scheme for calculating heats of reaction and other thermodynamic properties was developed. The rate constants calculated using the proposed correlations are in most cases within an order of magnitude of available experimental values, and 82% are within a factor of five.

    Free Register to Access Article

Nodoka Okada – One of the best experts on this subject based on the ideXlab platform.

  • sat based Automated Mechanism design for false name proof facility location
    Pacific Rim International Conference on Multi-Agents, 2019
    Co-Authors: Nodoka Okada, Taiki Todo, Makoto Yokoo

    Abstract:

    In the literature of Mechanism design, market Mechanisms have been developed by professionals based on their experience. The concept of Automated Mechanism design (AMD), initiated by Sandholm (2002), is a ground-breaking computer-aided framework to develop market Mechanisms. In this paper, we apply a very recent AMD approach based on Boolean Satisfiability (SAT) to the Mechanism design of false-name-proof facility location. We first provide a general theoretical characteristic of false-name-proof Mechanisms, which enables a quite compact representation of target Mechanisms. Our approach successfully reproduces several known results in the literature on false-name-proof facility locations over discrete structures. Furthermore, some unknown Mechanisms are discovered for locating a public good on a 2-by-2 grid, and an impossibility result is revealed for locating a public bad, with an additional mild assumption, on a 2-by-3 grid. Finally, we demonstrate the extendability of our approach, by providing a new false-name-proof Mechanism for a slightly modified problem of locating a public good.

    Free Register to Access Article

  • PRIMA – SAT-Based Automated Mechanism Design for False-Name-Proof Facility Location
    PRIMA 2019: Principles and Practice of Multi-Agent Systems, 2019
    Co-Authors: Nodoka Okada, Taiki Todo, Makoto Yokoo

    Abstract:

    In the literature of Mechanism design, market Mechanisms have been developed by professionals based on their experience. The concept of Automated Mechanism design (AMD), initiated by Sandholm (2002), is a ground-breaking computer-aided framework to develop market Mechanisms. In this paper, we apply a very recent AMD approach based on Boolean Satisfiability (SAT) to the Mechanism design of false-name-proof facility location. We first provide a general theoretical characteristic of false-name-proof Mechanisms, which enables a quite compact representation of target Mechanisms. Our approach successfully reproduces several known results in the literature on false-name-proof facility locations over discrete structures. Furthermore, some unknown Mechanisms are discovered for locating a public good on a 2-by-2 grid, and an impossibility result is revealed for locating a public bad, with an additional mild assumption, on a 2-by-3 grid. Finally, we demonstrate the extendability of our approach, by providing a new false-name-proof Mechanism for a slightly modified problem of locating a public good.

    Free Register to Access Article