Traffic Routing Oligopoly
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.
|Date of creation:||Mar 2013|
|Contact details of provider:|| Postal: 1112 Budapest, Budaorsi ut 45.|
Phone: (+36-1) 309-2652
Fax: (36-1) 319-3136
Web page: http://econ.core.hu
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Grabisch, Michel & Funaki, Yukihiko, 2012.
"A coalition formation value for games in partition function form,"
European Journal of Operational Research,
Elsevier, vol. 221(1), pages 175-185.
- Michel Grabisch & Yukihiko Funaki, 2012. "A coalition formation value for games in partition function form," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00690696, HAL.
- repec:hal:journl:halshs-00690696 is not listed on IDEAS
- LÃ¡szlÃ³ KÃ³czy, 2007. "A recursive core for partition function form games," Theory and Decision, Springer, vol. 63(1), pages 41-51, August.
- Kóczy László Á, 2006. "A recursive core for partition function form games," Research Memorandum 031, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Kóczy, László Á., 2009. "Sequential coalition formation and the core in the presence of externalities," Games and Economic Behavior, Elsevier, vol. 66(1), pages 559-565, May.
- Kóczy Lászlo Á., 2006. "Sequential Coalition Formation and the Core in the Presence of Externalities," Research Memorandum 047, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- László Á. Kóczy, 2006. "Sequential coalition formation and the core in the presence of externalities," Working Paper Series 0801, Óbuda University, Keleti Faculty of Business and Management, revised Apr 2008.
When requesting a correction, please mention this item's handle: RePEc:has:discpr:1309. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Adrienn Foldi)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.