Coalitional games via network flows

Talal Rahwan, Tri Dung Nguyen, Tomasz P. Michalak, Maria Polukarov, Madalina Croitoru, Nicholas R. Jennings

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationIJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence
Pages324-331
Number of pages8
StatePublished - Dec 1 2013
Event23rd International Joint Conference on Artificial Intelligence, IJCAI 2013 - Beijing, China
Duration: Aug 3 2013Aug 9 2013

Other

Other23rd International Joint Conference on Artificial Intelligence, IJCAI 2013
CountryChina
CityBeijing
Period8/3/138/9/13

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Rahwan, T., Nguyen, T. D., Michalak, T. P., Polukarov, M., Croitoru, M., & Jennings, N. R. (2013). Coalitional games via network flows. In IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 324-331)

Coalitional games via network flows. / Rahwan, Talal; Nguyen, Tri Dung; Michalak, Tomasz P.; Polukarov, Maria; Croitoru, Madalina; Jennings, Nicholas R.

IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence. 2013. p. 324-331.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rahwan, T, Nguyen, TD, Michalak, TP, Polukarov, M, Croitoru, M & Jennings, NR 2013, Coalitional games via network flows. in IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence. pp. 324-331, 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013, Beijing, China, 8/3/13.
Rahwan T, Nguyen TD, Michalak TP, Polukarov M, Croitoru M, Jennings NR. Coalitional games via network flows. In IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence. 2013. p. 324-331
Rahwan, Talal ; Nguyen, Tri Dung ; Michalak, Tomasz P. ; Polukarov, Maria ; Croitoru, Madalina ; Jennings, Nicholas R. / Coalitional games via network flows. IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence. 2013. pp. 324-331
@inproceedings{f43dcf36310c48e2afbe609a927fb343,
title = "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.",
author = "Talal Rahwan and Nguyen, {Tri Dung} and Michalak, {Tomasz P.} and Maria Polukarov and Madalina Croitoru and Jennings, {Nicholas R.}",
year = "2013",
month = "12",
day = "1",
language = "English (US)",
isbn = "9781577356332",
pages = "324--331",
booktitle = "IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence",

}

TY - GEN

T1 - Coalitional games via network flows

AU - Rahwan, Talal

AU - Nguyen, Tri Dung

AU - Michalak, Tomasz P.

AU - Polukarov, Maria

AU - Croitoru, Madalina

AU - Jennings, Nicholas R.

PY - 2013/12/1

Y1 - 2013/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84896062456&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84896062456&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84896062456

SN - 9781577356332

SP - 324

EP - 331

BT - IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence

ER -