Network Intervention by Polling Strategic Agents

The paper addresses the problem of setting optimal non‑discriminatory prices in a network of strategic agents with private information and potential misreporting. It shows that the optimal prices can be decomposed according to each agent’s squared centrality in a preference‑weighted network, leading to the Poll algorithm. Poll samples one agent per round, briefly explores its neighborhood, and updates prices locally, achieving significant computational, statistical, and economic efficiency gains over exact or other distributed methods.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

• agents
• safety