Robust Mechanism Design on Networks with Externalities

Kohmei Makihara

Papers from arXiv.org

Abstract: We study how to allocate a good with positive externalities among agents in an information network, without monetary transfers. Each agent observes their own valuation and those of their neighbors. A principal seeks to allocate the good to the highest-valuation agent through a mechanism robust to agents' heterogeneous belief hierarchies, leveraging the network structure and the partial incentive alignment created by allocative externalities. We characterize the networks for which a robustly efficient mechanism exists: it exists if and only if at least two agents are connected to all others. Relaxing robustness to rule out weakly dominated strategies, one universally connected agent suffices. We generalize the results to a broader class of utility functions, show that robust welfare maximization is impossible unless the network is complete, and establish that an ex post incentive compatible mechanism that is efficient under truthful reports exists if and only if no agent is isolated.

Date: 2026-09
New Economics Papers: this item is included in nep-des and nep-mic
References: Add references at CitEc
Citations:

Downloads: (external link)
https://arxiv.org/pdf/2609.35907 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2609.35907

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().