Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry

by   Matteo Castiglioni, et al.

Network congestion games are a well-understood model of multi-agent strategic interactions. Despite their ubiquitous applications, it is not clear whether it is possible to design information structures to ameliorate the overall experience of the network users. We focus on Bayesian games with atomic players, where network vagaries are modeled via a (random) state of nature which determines the costs incurred by the players. A third-party entity—the sender—can observe the realized state of the network and exploit this additional information to send a signal to each player. A natural question is the following: is it possible for an informed sender to reduce the overall social cost via the strategic provision of information to players who update their beliefs rationally? The paper focuses on the problem of computing optimal ex ante persuasive signaling schemes, showing that symmetry is a crucial property for its solution. Indeed, we show that an optimal ex ante persuasive signaling scheme can be computed in polynomial time when players are symmetric and have affine cost functions. Moreover, the problem becomes NP-hard when players are asymmetric, even in non-Bayesian settings.


page 1

page 2

page 3

page 4


Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs

We consider an atomic congestion game with stochastic demand in which ea...

Equilibrium Computation in Atomic Splittable Routing Games with Convex Cost Functions

We present polynomial-time algorithms as well as hardness results for eq...

In Congestion Games, Taxes Achieve Optimal Approximation

We consider the problem of minimizing social cost in atomic congestion g...

Avoiding Unintended Consequences: How Incentives Aid Information Provisioning in Bayesian Congestion Games

When users lack specific knowledge of various system parameters, their u...

RLupus: Cooperation through emergent communication in The Werewolf social deduction game

This paper focuses on the emergence of communication to support cooperat...

Algorithmic Information Design in Multi-Player Games: Possibility and Limits in Singleton Congestion

Most algorithmic studies on multi-agent information design so far have f...

Bayesian Conversations

We initiate the study of Bayesian conversations, which model interactive...

Please sign up or login with your details

Forgot password? Click here to reset