Bounded Incentives in Manipulating the Probabilistic Serial Rule

01/28/2020
by   Zihe Wang, et al.
9

The Probabilistic Serial mechanism is well-known for its desirable fairness and efficiency properties. It is one of the most prominent protocols for the random assignment problem. However, Probabilistic Serial is not incentive-compatible, thereby these desirable properties only hold for the agents' declared preferences, rather than their genuine preferences. A substantial utility gain through strategic behaviors would trigger self-interested agents to manipulate the mechanism and would subvert the very foundation of adopting the mechanism in practice. In this paper, we characterize the extent to which an individual agent can increase its utility by strategic manipulation. We show that the incentive ratio of the mechanism is 3/2. That is, no agent can misreport its preferences such that its utility becomes more than 1.5 times of what it is when reports truthfully. This ratio is a worst-case guarantee by allowing an agent to have complete information about other agents' reports and to figure out the best response strategy even if it is computationally intractable in general. To complement this worst-case study, we further evaluate an agent's utility gain on average by experiments. The experiments show that an agent' incentive in manipulating the rule is very limited. These results shed some light on the robustness of Probabilistic Serial against strategic manipulation, which is one step further than knowing that it is not incentive-compatible.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/22/2021

Incentive Compatible Mechanism for Influential Agent Selection

Selecting the most influential agent in a network has huge practical val...
research
07/22/2023

Nonbossy Mechanisms: Mechanism Design Robust to Secondary Goals

We study mechanism design when agents may have hidden secondary goals wh...
research
06/28/2023

Incentive Ratios for Fairly Allocating Indivisible Goods: Simple Mechanisms Prevail

We study the problem of fairly allocating indivisible goods among strate...
research
11/20/2019

Incentive-Compatible Classification

We investigate the possibility of an incentive-compatible (IC, a.k.a. st...
research
04/07/2021

Quantifying incentive (in)compatibility: a case study from sports

Incentive compatibility is usually considered a binary concept in the ac...
research
02/19/2018

Incentive Design in a Distributed Problem with Strategic Agents

In this paper, we consider a general distributed system with multiple ag...
research
08/09/2021

Bob and Alice Go to a Bar: Reasoning About Future With Probabilistic Programs

Agent preferences should be specified stochastically rather than determi...

Please sign up or login with your details

Forgot password? Click here to reset