DeepAI
Log In Sign Up

Incentive-Compatible Classification

11/20/2019
by   Yakov Babichenko, et al.
0

We investigate the possibility of an incentive-compatible (IC, a.k.a. strategy-proof) mechanism for the classification of agents in a network according to their reviews of each other. In the α-classification problem we are interested in selecting the top α fraction of users. We give upper bounds (impossibilities) and lower bounds (mechanisms) on the worst-case coincidence between the classification of an IC mechanism and the ideal α-classification. We prove bounds which depend on α and on the maximal number of reviews given by a single agent, Δ. Our results show that it is harder to find a good mechanism when α is smaller and Δ is larger. In particular, if Δ is unbounded, then the best mechanism is trivial (that is, it does not take into account the reviews). On the other hand, when Δ is sublinear in the number of agents, we give a simple, natural mechanism, with a coincidence ratio of α.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/22/2021

Incentive Compatible Mechanism for Influential Agent Selection

Selecting the most influential agent in a network has huge practical val...
05/21/2018

Incentive-Compatible Diffusion

Our work bridges the literature on incentive-compatible mechanism design...
01/28/2020

Bounded Incentives in Manipulating the Probabilistic Serial Rule

The Probabilistic Serial mechanism is well-known for its desirable fairn...
05/31/2020

Incentive-Compatible Selection Mechanisms for Forests

Given a directed forest-graph, a probabilistic selection mechanism is a ...
07/20/2021

Prior-Free Clock Auctions for Bidders with Interdependent Values

We study the problem of selling a good to a group of bidders with interd...
07/04/2018

Recommendation Systems and Self Motivated Users

Modern recommendation systems rely on the wisdom of the crowd to learn t...
12/29/2020

The Communication Complexity of Payment Computation

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