3.8 Proceedings Paper

Equilibrium analysis of game on heterogeneous networks with coupled activities

Publisher

IEEE
DOI: 10.1109/ALLERTON49937.2022.9929317

Keywords

-

Funding

  1. National Science Foundation [2039771]
  2. Directorate For Engineering
  3. Div Of Civil, Mechanical, & Manufact Inn [2039771] Funding Source: National Science Foundation

Ask authors/readers for more resources

This article studies a game where agents interact over a network and engage in two coupled activities. The authors consider the general case where the network effects are heterogeneous across activities and derive a sufficient condition for the existence and uniqueness of a Nash equilibrium. They apply this game in the context of palm oil tree cultivation and timber harvesting.
We study a game where agents interacting over a network engage in two coupled activities and have to strategically decide their production for each of these activities. Agent interactions involve local and global network effects, as well as a coupling between activities. We consider the general case where the network effects are heterogeneous across activities, i.e., the underlying graph structures of the two activities differ and/or the parameters of the network effects are not equal. In particular, we apply this game in the context of palm oil tree cultivation and timber harvesting, where network structures are defined by spatial boundaries of concessions. We first derive a sufficient condition for the existence and uniqueness of a Nash equilibrium. This condition can be derived using the potential game property of our game or by employing variational inequality framework. We show that the equilibrium can be expressed as a linear combination of two Bonacich centrality vectors.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

3.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available