Coalitional Games via Network Flows
Coalitional Games via Network Flows
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.
978-1-57735-633-2
324-331
Rahwan, Talal
476029f3-5484-4747-9f44-f63f3687083c
Nguyen, Tri-Dung
a6aa7081-6bf7-488a-b72f-510328958a8e
Michalak, Tomasz
e24bfee3-bd75-4cca-8220-6f3c2f39dc38
Polukarov, Maria
bd2f0623-9e8a-465f-8b29-851387a64740
Croitoru, Madalina
4a2ca559-8d8f-4b3d-8622-c2f83796dadc
Jennings, Nicholas R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
2013
Rahwan, Talal
476029f3-5484-4747-9f44-f63f3687083c
Nguyen, Tri-Dung
a6aa7081-6bf7-488a-b72f-510328958a8e
Michalak, Tomasz
e24bfee3-bd75-4cca-8220-6f3c2f39dc38
Polukarov, Maria
bd2f0623-9e8a-465f-8b29-851387a64740
Croitoru, Madalina
4a2ca559-8d8f-4b3d-8622-c2f83796dadc
Jennings, Nicholas R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Rahwan, Talal, Nguyen, Tri-Dung, Michalak, Tomasz, Polukarov, Maria, Croitoru, Madalina and Jennings, Nicholas R.
(2013)
Coalitional Games via Network Flows.
Proc. 23rd International Joint Conference on AI (IJCAI).
.
Record type:
Conference or Workshop Item
(Paper)
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.
Text
Coalition Formation via Network Flow (IJCAI-13).pdf
- Author's Original
More information
Published date: 2013
Venue - Dates:
Proc. 23rd International Joint Conference on AI (IJCAI), 2013-01-01
Organisations:
Agents, Interactions & Complexity
Identifiers
Local EPrints ID: 351837
URI: http://eprints.soton.ac.uk/id/eprint/351837
ISBN: 978-1-57735-633-2
PURE UUID: 08311bc8-cc93-410e-bc32-a8564137db7f
Catalogue record
Date deposited: 26 Apr 2013 11:48
Last modified: 15 Mar 2024 03:37
Export record
Contributors
Author:
Talal Rahwan
Author:
Tri-Dung Nguyen
Author:
Tomasz Michalak
Author:
Maria Polukarov
Author:
Madalina Croitoru
Author:
Nicholas R. Jennings
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics