Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/108301
Authors: 
Csercsik, Dávid
Sziklai, Balázs
Year of Publication: 
2013
Series/Report no.: 
IEHAS Discussion Papers MT-DP - 2013/9
Abstract: 
The purpose of this paper is to introduce a novel family of games related to congested networks. Traffic routing has been extensively analyzed from the non-cooperative aspect. A common assumption is that each individual optimizes his route in the network selfishly. However looking at the same network from a different scope in some cases we can find some actors that are responsible for the majority part of the traffic. From the point of view of these actors cooperation is indeed an inherent possibility of the game. Sharing information and cooperation with other agents may result in cost savings, and more efficient utilization of network capacities. Depending on the goal and employed strategy of the agents many possible cooperative games can arise. Our aim is to introduce and analyze these wide variety of transferable utility (TU) games. Since the formation of a coalition may affect other players costs via the implied flow and the resulting edge load changes in the network, externalities may arise, thus the underlying games are given in partition function form.
Subjects: 
Cooperative game theory
Partition function form games
Routing
Externalities
JEL: 
C71
L13
L91
ISBN: 
978-615-5243-61-5
Document Type: 
Working Paper

Files in This Item:
File
Size
490.34 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.