Results 11 to 20 of about 1,225 (207)
Shortest Paths from a Group Perspective—A Note on Selfish Routing Games with Cognitive Agents
ISPRS International Journal of Geo-Information, 2018 This paper presents an analysis of the effects of cognitive agents employing selfish routing behavior in traffic networks with linear latency functions.
Johannes Scholz, Richard L. Church
doaj +2 more sources
Social Contribution-Based Routing Protocol for Vehicular Network with Selfish Nodes
International Journal of Distributed Sensor Networks, 2014 Routing in vehicular network is a challenging task due to the characteristic of intermittent connectivity, especially when nodes behave selfishly in the real world.
Haigang Gong, Lingfei Yu, Xue Zhang
doaj +2 more sources
A Hot-Area-Based Selfish Routing Protocol for Mobile Social Networks
International Journal of Distributed Sensor Networks, 2013 Data delivery in mobile social network is a challenging task due to the nodal mobility and intermittent connectivity. It is natural to utilize the inherent social properties to assist in making forwarding decisions.
Haigang Gong, Xiaomin Wang
doaj +2 more sources
Selfish Routing on Dynamic Flows
CoRR, 2015 Oberlin College Computer Science Honors Thesis.
Antonsen, Christine Marie
openaire +4 more sources
Cost-Sharing in Generalised Selfish Routing [PDF]
, 2017 © Springer International Publishing AG 2017. We study a generalisation of atomic selfish routing games where each player may control multiple flows which she routes seek-ing to minimise their aggregate cost. Such games emerge in various set-tings, such as traffic routing in road networks by competing ride-sharing applications or packet routing in ...
Martin Gairing +2 more
openaire +2 more sources
The Price of Anarchy in Selfish Multicast Routing [PDF]
, 2006 We study the price of anarchy for selfish multicast routing games in directed multigraphs with latency functions on the edges, extending the known theory for the unicast situation, and exhibiting new phenomena not present in the unicast model. In the multicast model we have N commodities (or player classes), where for each $ i=1,\hdots,N$, a flow from ...
Andreas Baltz +3 more
openaire +2 more sources
An Improved Tax Scheme for Selfish Routing. [PDF]
, 2016 We study the problem of routing traffic for independent selfish users in a congested network to minimize the total latency. The inefficiency of selfish routing motivates regulating the flow of the system to lower the total latency of the Nash Equilibrium by economic incentives or penalties.
Wang, Te-Li +2 more
openaire +4 more sources
A Service-Based Selfish Routing for Mobile Social Networks
International Journal of Distributed Sensor Networks, 2015 Routing in mobile social networks is a challenging task due to the characteristic of intermittent connectivity, especially when the nodes behave selfishly in real world.
Lingfei Yu, Pengfei Liu
doaj +2 more sources
Nonadaptive Selfish Routing with Online Demands [PDF]
, 2007 We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players reroute their flow and form a new equilibrium upon arrival of a new demand. In our model, demands arrive in n sequential games.
Tobias Harks, László A. Végh
openaire +2 more sources
, 2007 This thesis deals with dynamic, load-adaptive rerouting policies in game theoretic settings. In the Wardrop model, which forms the basis of our dynamic population model, each of an infinite number of agents injects an infinitesimal amount of flow into a network, which in turn induces latency on the edges.
Simon Fischer, Fischer, Simon
openaire +3 more sources