Coalition-Flow Networks: Generalised Network Flows for Coalition Games: Unterschied zwischen den Versionen
Gsc (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=Coalition-Flow Networks: Generalised Network Flows for Coalition Games |Titel EN=Coalition-Flow Networks: Generalised Network Flows for …“) |
Gsc (Diskussion | Beiträge) |
||
| Zeile 5: | Zeile 5: | ||
ally, this representation is based on the 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. We show that our new way of representing this process is intuitive, fully expressive, and allows for representing certain patterns in a significantly more concise manner compared to the conventional approach. Furthermore, we show that CF-NETs have the capability to represent | ally, this representation is based on the 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. We show that our new way of representing this process is intuitive, fully expressive, and allows for representing certain patterns in a significantly more concise manner compared to the conventional approach. Furthermore, we show that CF-NETs have the capability to represent | ||
different classes of games, namely characteristic function games, coalitional games with overlapping coalitions, and coalitional games with identical agents. | different classes of games, namely characteristic function games, coalitional games with overlapping coalitions, and coalitional games with identical agents. | ||
| − | |||
|Beschreibung EN=In this talk we detail a Generalised Network Flow representation for Coalition Games, CF-NETs. Specific | |Beschreibung EN=In this talk we detail a Generalised Network Flow representation for Coalition Games, CF-NETs. Specific | ||
ally, this representation is based on the 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. We show that our new way of representing this process is intuitive, fully expressive, and allows for representing certain patterns in a significantly more concise manner compared to the conventional approach. Furthermore, we show that CF-NETs have the capability to represent | ally, this representation is based on the 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. We show that our new way of representing this process is intuitive, fully expressive, and allows for representing certain patterns in a significantly more concise manner compared to the conventional approach. Furthermore, we show that CF-NETs have the capability to represent | ||
different classes of games, namely characteristic function games, coalitional games with overlapping coalitions, and coalitional games with identical agents. | different classes of games, namely characteristic function games, coalitional games with overlapping coalitions, and coalitional games with identical agents. | ||
| − | |||
|Veranstaltungsart=Kolloquium Angewandte Informatik | |Veranstaltungsart=Kolloquium Angewandte Informatik | ||
|Start=2010/11/19 14:00:00 | |Start=2010/11/19 14:00:00 | ||
| Zeile 17: | Zeile 15: | ||
|Vortragender=Madalina Croitoru, Associate Professor University of Montpellier II, Graphik INRIA | |Vortragender=Madalina Croitoru, Associate Professor University of Montpellier II, Graphik INRIA | ||
|Eingeladen durch=Rudi Studer | |Eingeladen durch=Rudi Studer | ||
| + | |PDF=Kolloquium Croitoru 19 11 10.pdf | ||
|Forschungsgruppe=Wissensmanagement | |Forschungsgruppe=Wissensmanagement | ||
|In News anzeigen=False | |In News anzeigen=False | ||
}} | }} | ||
Aktuelle Version vom 2. November 2010, 10:28 Uhr
Coalition-Flow Networks: Generalised Network Flows for Coalition Games
Veranstaltungsart:
Kolloquium Angewandte Informatik
In this talk we detail a Generalised Network Flow representation for Coalition Games, CF-NETs. Specific
ally, this representation is based on the 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. We show that our new way of representing this process is intuitive, fully expressive, and allows for representing certain patterns in a significantly more concise manner compared to the conventional approach. Furthermore, we show that CF-NETs have the capability to represent
different classes of games, namely characteristic function games, coalitional games with overlapping coalitions, and coalitional games with identical agents.
(Madalina Croitoru, Associate Professor University of Montpellier II, Graphik INRIA)
Start: 19. November 2010 um 14:00
Ende: 19. November 2010 um 15:00
Im Gebäude 11.40, Raum: 231
Veranstaltung vormerken: (iCal)
Veranstalter: Forschungsgruppe(n) Wissensmanagement
Information: Media:Kolloquium Croitoru 19 11 10.pdf