Solution Concepts for Cooperative Games with Circular Communication Structure

T. Suzuki, A.J.J. Talman

Research output: Working paperDiscussion paperOther research output

252 Downloads (Pure)

Abstract

We study transferable utility games with limited cooperation between the agents. The focus is on communication structures where the set of agents forms a circle, so that the possibilities of cooperation are represented by the connected sets of nodes of an undirected circular graph. Agents are able to cooperate in a coalition only if they can form a network in the graph. A single-valued solution which averages marginal contributions of each player is considered. We restrict the set of permutations, which induce marginal contributions to be averaged, to the ones in which every agent is connected to the agent that precedes this agent in the permutation. Staring at a given agent, there are two permutations which satisfy this restriction, one going clockwise and one going anticlockwise along the circle. For each such permutation a marginal vector is determined that gives every player his marginal contribution when joining the preceding agents. It turns out that the average of these marginal vectors coincides with the average tree solution. We also show that the same solution is obtained if we allow an agent to join if this agent is connected to some of the agents who is preceding him in the permutation, not necessarily being the last one. In this case the number of permutations and marginal vectors is much larger, because after the initial agent each time two agents can join instead of one, but the average of the corresponding marginal vectors is the same. We further give weak forms of convexity that are necessary and sufficient conditions for the core stability of all those marginal vectors and the solution. An axiomatization of the solution on the class of circular graph games is also given.
Original languageEnglish
Place of PublicationTilburg
PublisherEconometrics
Volume2011-100
Publication statusPublished - 2011

Publication series

NameCentER Discussion Paper
Volume2011-100

Fingerprint

Communication
Joining

Keywords

  • Cooperative game
  • graph structure
  • average tree solution
  • Myerson value
  • core stability
  • convexity

Cite this

Suzuki, T., & Talman, A. J. J. (2011). Solution Concepts for Cooperative Games with Circular Communication Structure. (CentER Discussion Paper; Vol. 2011-100). Tilburg: Econometrics.
Suzuki, T. ; Talman, A.J.J. / Solution Concepts for Cooperative Games with Circular Communication Structure. Tilburg : Econometrics, 2011. (CentER Discussion Paper).
@techreport{d863606fa58a4f92894de542304f1c29,
title = "Solution Concepts for Cooperative Games with Circular Communication Structure",
abstract = "We study transferable utility games with limited cooperation between the agents. The focus is on communication structures where the set of agents forms a circle, so that the possibilities of cooperation are represented by the connected sets of nodes of an undirected circular graph. Agents are able to cooperate in a coalition only if they can form a network in the graph. A single-valued solution which averages marginal contributions of each player is considered. We restrict the set of permutations, which induce marginal contributions to be averaged, to the ones in which every agent is connected to the agent that precedes this agent in the permutation. Staring at a given agent, there are two permutations which satisfy this restriction, one going clockwise and one going anticlockwise along the circle. For each such permutation a marginal vector is determined that gives every player his marginal contribution when joining the preceding agents. It turns out that the average of these marginal vectors coincides with the average tree solution. We also show that the same solution is obtained if we allow an agent to join if this agent is connected to some of the agents who is preceding him in the permutation, not necessarily being the last one. In this case the number of permutations and marginal vectors is much larger, because after the initial agent each time two agents can join instead of one, but the average of the corresponding marginal vectors is the same. We further give weak forms of convexity that are necessary and sufficient conditions for the core stability of all those marginal vectors and the solution. An axiomatization of the solution on the class of circular graph games is also given.",
keywords = "Cooperative game, graph structure, average tree solution, Myerson value, core stability, convexity",
author = "T. Suzuki and A.J.J. Talman",
year = "2011",
language = "English",
volume = "2011-100",
series = "CentER Discussion Paper",
publisher = "Econometrics",
type = "WorkingPaper",
institution = "Econometrics",

}

Suzuki, T & Talman, AJJ 2011 'Solution Concepts for Cooperative Games with Circular Communication Structure' CentER Discussion Paper, vol. 2011-100, Econometrics, Tilburg.

Solution Concepts for Cooperative Games with Circular Communication Structure. / Suzuki, T.; Talman, A.J.J.

Tilburg : Econometrics, 2011. (CentER Discussion Paper; Vol. 2011-100).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - Solution Concepts for Cooperative Games with Circular Communication Structure

AU - Suzuki, T.

AU - Talman, A.J.J.

PY - 2011

Y1 - 2011

N2 - We study transferable utility games with limited cooperation between the agents. The focus is on communication structures where the set of agents forms a circle, so that the possibilities of cooperation are represented by the connected sets of nodes of an undirected circular graph. Agents are able to cooperate in a coalition only if they can form a network in the graph. A single-valued solution which averages marginal contributions of each player is considered. We restrict the set of permutations, which induce marginal contributions to be averaged, to the ones in which every agent is connected to the agent that precedes this agent in the permutation. Staring at a given agent, there are two permutations which satisfy this restriction, one going clockwise and one going anticlockwise along the circle. For each such permutation a marginal vector is determined that gives every player his marginal contribution when joining the preceding agents. It turns out that the average of these marginal vectors coincides with the average tree solution. We also show that the same solution is obtained if we allow an agent to join if this agent is connected to some of the agents who is preceding him in the permutation, not necessarily being the last one. In this case the number of permutations and marginal vectors is much larger, because after the initial agent each time two agents can join instead of one, but the average of the corresponding marginal vectors is the same. We further give weak forms of convexity that are necessary and sufficient conditions for the core stability of all those marginal vectors and the solution. An axiomatization of the solution on the class of circular graph games is also given.

AB - We study transferable utility games with limited cooperation between the agents. The focus is on communication structures where the set of agents forms a circle, so that the possibilities of cooperation are represented by the connected sets of nodes of an undirected circular graph. Agents are able to cooperate in a coalition only if they can form a network in the graph. A single-valued solution which averages marginal contributions of each player is considered. We restrict the set of permutations, which induce marginal contributions to be averaged, to the ones in which every agent is connected to the agent that precedes this agent in the permutation. Staring at a given agent, there are two permutations which satisfy this restriction, one going clockwise and one going anticlockwise along the circle. For each such permutation a marginal vector is determined that gives every player his marginal contribution when joining the preceding agents. It turns out that the average of these marginal vectors coincides with the average tree solution. We also show that the same solution is obtained if we allow an agent to join if this agent is connected to some of the agents who is preceding him in the permutation, not necessarily being the last one. In this case the number of permutations and marginal vectors is much larger, because after the initial agent each time two agents can join instead of one, but the average of the corresponding marginal vectors is the same. We further give weak forms of convexity that are necessary and sufficient conditions for the core stability of all those marginal vectors and the solution. An axiomatization of the solution on the class of circular graph games is also given.

KW - Cooperative game

KW - graph structure

KW - average tree solution

KW - Myerson value

KW - core stability

KW - convexity

M3 - Discussion paper

VL - 2011-100

T3 - CentER Discussion Paper

BT - Solution Concepts for Cooperative Games with Circular Communication Structure

PB - Econometrics

CY - Tilburg

ER -

Suzuki T, Talman AJJ. Solution Concepts for Cooperative Games with Circular Communication Structure. Tilburg: Econometrics. 2011. (CentER Discussion Paper).