Equilibrium in risk-sharing games

13Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The large majority of risk-sharing transactions involve few agents, each of whom can heavily influence the structure and the prices of securities. In this paper, we propose a game where agents’ strategic sets consist of all possible sharing securities and pricing kernels that are consistent with Arrow–Debreu sharing rules. First, it is shown that agents’ best response problems have unique solutions. The risk-sharing Nash equilibrium admits a finite-dimensional characterisation, and it is proved to exist for an arbitrary number of agents and to be unique in the two-agent game. In equilibrium, agents declare beliefs on future random outcomes different from their actual probability assessments, and the risk-sharing securities are endogenously bounded, implying (among other things) loss of efficiency. In addition, an analysis regarding extremely risk-tolerant agents indicates that they profit more from the Nash risk-sharing equilibrium than compared to the Arrow–Debreu one.

Cite

CITATION STYLE

APA

Anthropelos, M., & Kardaras, C. (2017). Equilibrium in risk-sharing games. Finance and Stochastics, 21(3), 815–865. https://doi.org/10.1007/s00780-017-0323-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free