Resilient Information Aggregation

Itai Arieli, Ivan Geffner, Moshe Tennenholtz
7/11/2023
econ.THcs.GTcs.MA

No confident code implementation found for this paper.

Abstract

In an information aggregation game, a set of senders interact with a receiver through a mediator. Each sender observes the state of the world and communicates a message to the mediator, who recommends an action to the receiver based on the messages received. The payoff of the senders and of the receiver depend on both the state of the world and the action selected by the receiver. This setting extends the celebrated cheap talk model in two aspects: there are many senders (as opposed to just one) and there is a mediator. From a practical perspective, this setting captures platforms in which strategic experts advice is aggregated in service of action recommendations to the user. We aim at finding an optimal mediator/platform that maximizes the users' welfare given highly resilient incentive compatibility requirements on the equilibrium selected: we want the platform to be incentive compatible for the receiver/user when selecting the recommended action, and we want it to be resilient against group deviations by the senders/experts. We provide highly positive answers to this challenge, manifested through efficient algorithms.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{arieli2023resilient,
  title  = {Resilient Information Aggregation},
  author = {Itai Arieli and Ivan Geffner and Moshe Tennenholtz},
  year   = {2023},
  eprint = {2307.05054},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.05054v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.05054.svg)](https://codeofpaper.com/paper/2307.05054)

Discussion