Decentralized Cooperative Network Games in Economics and Finance

This paper introduces a new class of cooperative graphical games, where multiple coalitions engage in decentralized bargaining processes to optimize their collective goals. Unlike traditional cooperative game theory, which often overlooks the dynamics of internal bargaining within coalitions, our approach incorporates a graphical communication structure that includes multigraphs and hypergraphs. This framework introduces a novel concept, the “importance value,” which quantifies the influence of agents and coalitions in the bargaining process. By leveraging distributed optimization techniques, we employ a dual decomposition algorithm that guarantees convergence in a single iteration of bargaining. Additionally, combinatorial methods are used to determine the optimal allocation of agents to bargaining relationships, ensuring an efficient solution to the distributed optimization problem.

Publication Details

Journal
Apollo (University of Cambridge)
Published
2025-02-07
DOI
https://doi.org/10.17863/cam.118361
Primary Topic
Game Theory and Voting Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Decentralized Cooperative Network Games in Economics and Finance

Apollo (University of Cambridge)
Game Theory and Voting Systems
article

Decentralized Cooperative Network Games in Economics and Finance

article en

Abstract

This paper introduces a new class of cooperative graphical games, where multiple coalitions engage in decentralized bargaining processes to optimize their collective goals. Unlike traditional cooperative game theory, which often overlooks the dynamics of internal bargaining within coalitions, our approach incorporates a graphical communication structure that includes multigraphs and hypergraphs. This framework introduces a novel concept, the “importance value,” which quantifies the influence of agents and coalitions in the bargaining process. By leveraging distributed optimization techniques, we employ a dual decomposition algorithm that guarantees convergence in a single iteration of bargaining. Additionally, combinatorial methods are used to determine the optimal allocation of agents to bargaining relationships, ensuring an efficient solution to the distributed optimization problem.

Apollo (University of Cambridge)
Openalex Percentile: Top 44%
Game Theory and Voting Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.