Two-player incentive compatible mechanisms are affine maximizers

10/14/2017
by   Bo Lin, et al.
0

In mechanism design, for a given type space, there may be incentive compatible mechanisms which are not affine maximizers. We prove that for two-player games on a discrete type space, any given mechanism can be turned into an affine maximizer through a nontrivial perturbation of the type space. Furthermore, our theorem is the strongest possible in this setup. Our proof relies on new results on the tropical determinant.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2017

Two-player incentive compatible outcome functions are affine maximizers

In mechanism design, for a given type space, there may be incentive comp...
research
02/03/2020

Limitations of Incentive Compatibility on Discrete Type Spaces

In the design of incentive compatible mechanisms, a common approach is t...
research
03/31/2022

An Affine Type System with Hindley-Milner Style Type Inference

This article first provides an algorithm W based type inference algorith...
research
06/21/2021

Incentive-Compatible Kidney Exchange in a Slightly Semi-Random Model

Motivated by kidney exchange, we study the following mechanism-design pr...
research
05/21/2018

Incentive-Compatible Diffusion

Our work bridges the literature on incentive-compatible mechanism design...
research
01/26/2022

Characterization of Incentive Compatibility of an Ex-Ante Constrained Player

We consider a variant of the standard Bayesian mechanism, where players ...
research
11/03/2022

The Polyhedral Geometry of Truthful Auctions

The difference set of an outcome in an auction is the set of types that ...

Please sign up or login with your details

Forgot password? Click here to reset