Two-player incentive compatible outcome functions 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 outcome functions which are not affine maximizers. We prove that for two-player games on a discrete type space, any given outcome function can be turned into an affine maximizer through a nontrivial perturbation of the type space. Furthermore, our theorems are the strongest possible in this setup.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2017

Two-player incentive compatible mechanisms are affine maximizers

In mechanism design, for a given type space, there may be incentive comp...
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 ...
research
02/11/2023

Zero-Knowledge Mechanisms

A powerful feature in mechanism design is the ability to irrevocably com...
research
12/29/2020

Exponential Communication Separations between Notions of Selfishness

We consider the problem of implementing a fixed social choice function b...
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
04/12/2022

Inducing Social Optimality in Games via Adaptive Incentive Design

How can a social planner adaptively incentivize selfish agents who are l...
research
12/29/2020

The Communication Complexity of Payment Computation

Let (f,P) be an incentive compatible mechanism where f is the social cho...

Please sign up or login with your details

Forgot password? Click here to reset