Coalitional Games via Network Flows - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2013

Coalitional Games via Network Flows

Abstract

We introduce a new representation scheme for coalitional games, called coalition-flow networks (CF-NETs), where the formation of effective coalitions in a task-based setting is reduced to the problem of directing flow through a network. We show that our representation is intuitive, fully expressive, and captures certain patterns in a significantly more concise manner compared to the conventional approach. Furthermore, our representation has the flexibility to express various classes of games, such as characteristic function games, coalitional games with overlapping coalitions, and coalitional games with agent types. As such, to the best of our knowledge, CF-NETs is the first representation that allows for switching conveniently and efficiently between overlapping/non-overlapping coalitions, with/without agent types. We demonstrate the efficiency of our scheme on the coalition structure generation problem, where near-optimal solutions for large instances can be found in a matter of seconds.
Fichier principal
Vignette du fichier
7007-30591-1-PB.pdf (2.62 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-00936484 , version 1 (07-01-2021)

Identifiers

  • HAL Id : lirmm-00936484 , version 1

Cite

Talal Rahwan, Tri-Dung Nguyen, Tomasz P. Michalak, Maria Polukarov, Madalina Croitoru, et al.. Coalitional Games via Network Flows. IJCAI: International Joint Conference on Artificial Intelligence, Aug 2013, Beijing, China. pp.324-331. ⟨lirmm-00936484⟩
251 View
25 Download

Share

Gmail Mastodon Facebook X LinkedIn More