Ordinal Bayesian incentive compatibility in random assignment model

by   Sulagna Dasgupta, et al.

We explore the consequences of weakening the notion of incentive compatibility from strategy-proofness to ordinal Bayesian incentive compatibility (OBIC) in the random assignment model. If the common prior of the agents is a uniform prior, then a large class of random mechanisms are OBIC with respect to this prior – this includes the probabilistic serial mechanism. We then introduce a robust version of OBIC: a mechanism is locally robust OBIC if it is OBIC with respect all independent priors in some neighborhood of a given independent prior. We show that every locally robust OBIC mechanism satisfying a mild property called elementary monotonicity is strategy-proof. This leads to a strengthening of the impossibility result in Bogomolnaia and Moulin (2001): if there are at least four agents, there is no locally robust OBIC and ordinally efficient mechanism satisfying equal treatment of equals.



There are no comments yet.


page 1

page 2

page 3

page 4


Characterization of Incentive Compatibility of an Ex-Ante Constrained Player

We consider a variant of the standard Bayesian mechanism, where players ...

Two New Impossibility Results for the Random Assignment Problem

In this note, we prove two new impossibility results for random assignme...

Probabilistic Verification for Obviously Strategyproof Mechanisms

Obviously strategyproof (OSP) mechanisms maintain the incentive compatib...

Limitations of Incentive Compatibility on Discrete Type Spaces

In the design of incentive compatible mechanisms, a common approach is t...

Segmentation, Incentives and Privacy

Data driven segmentation is the powerhouse behind the success of online ...

The Probabilistic Serial and Random Priority Mechanisms with Minimum Quotas

Consider the problem of assigning indivisible objects to agents with str...

Internet Appendix for "Sequential Bargaining Based Incentive Mechanism for Collaborative Internet Access"

This document is an Internet Appendix of paper entitled "Sequential Barg...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.