Constructing a type-adjustable mechanism to yield Pareto-optimal outcomes
In mechanism design theory, agents' types are described as their private information, and the designer may reveal some public information to affect agents' types in order to obtain more payoffs. Traditionally, each agent's private type and the public information are represented as a random variable respectively. In this paper, we propose a type-adjustable mechanism where each agent's private type is represented as a function of two parameters, \emph{i.e.}, his intrinsic factor and an external factor. Each agent's intrinsic factor is modeled as a private random variable, and the external factor is modeled as a solution of the designer's optimization problem. If the designer chooses an optimal value of external factor as public information, the type-adjustable mechanism may yield Pareto-optimal outcomes, which let the designer and each agent obtain more expected payoffs than what they would obtain at most in the traditional optimal mechanisms. As a comparison, in an auction with interdependent values, only the seller will benefit from public information which is represented as a random variable. We propose a revised version of revelation principle for type-adjustable Bayesian equilibrium. In the end, we compare the type-adjustable mechanism with other relevant models.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
What is Fair? Exploring Pareto-Efficiency for Fairness Constrained Classifiers
The potential for learned models to amplify existing societal biases has been broadly recognized. Fairness-aware classifier constraints, which apply equality metrics of performance across subgroups defined on sensitive a…
FairnessDifficulty Adjustable and Scalable Constrained Multi-objective Test Problem Toolkit
Multi-objective evolutionary algorithms (MOEAs) have progressed significantly in recent decades, but most of them are designed to solve unconstrained multi-objective optimization problems. In fact, many real-world multi-…
DiversityEvolutionary AlgorithmsIncentives and Efficiency in Constrained Allocation Mechanisms
We study private-good allocation under general constraints. Several prominent examples are special cases, including house allocation, roommate matching, social choice, and multiple assignment. Every individually strategy…
Scenario Generation in Roundabouts with Adjustable Interaction Intensity
Roundabouts, characterized by frequent merging and yielding interactions, remain a safety-critical corner case for the development and testing of intelligent driving functions. However, extracting sufficient near-critica…
DNN-Enabled Multi-User Beamforming for Throughput Maximization under Adjustable Fairness
Ensuring user fairness in wireless communications is a fundamental challenge, as balancing the trade-off between fairness and sum rate leads to a non-convex, multi-objective optimization whose complexity grows with netwo…