A Network Flow Approach to Coalitional Games

Authors:
Talal Rahwan;Tomasz Michalak;Madalina Croitoru;Jacek Sroka;Nicholas R. Jennings
Affiliations:
School of Electronics and Computer Science, University of Southampton, UK;School of Electronics and Computer Science, University of Southampton, UK;LIRMM, University of Montpellier, France;Institute of Informatics, University of Warsaw, Poland;School of Electronics and Computer Science, University of Southampton, UK
Venue:
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Year:
2010

Citing 6
Cited 0

On the complexity of cooperative solution concepts

Mathematics of Operations Research
Marginal contribution nets: a compact representation scheme for coalitional games

Proceedings of the 6th ACM conference on Electronic commerce
An improved dynamic programming algorithm for coalition structure generation

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
On representing coalitional games with externalities

Proceedings of the 10th ACM conference on Electronic commerce
Coalition structure generation: dynamic programming meets anytime optimization

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Near-optimal anytime coalition structure generation

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a novel approach to represent coalitional games, called a Coalition-Flow Network (CF-NET), that builds upon a generalization of the network flow literature. Specifically, this representation is based on our observation that the coalition formation process can be viewed as the problem of directing the flow through a network where every edge has certain capacity constraints.