Similar Search Results

Csercsik, Dávid; Sziklai, Balázs - 2013

The purpose of this paper is to introduce a novel family of games related to congested networks. Traffic routing has … in the network selfishly. However looking at the same network from a different scope in some cases we can find some …, and more efficient utilization of network capacities. Depending on the goal and employed strategy of the agents many …

Persistent link: https://www.econbiz.de/10009719701

On Games Arising from Multi-Depot Chinese Postman Problems

Platz, Trine T. - 2013

This paper introduces cooperative games arising from multi-depot Chinese postman problems and explores the properties of these games. A multi-depot Chinese postman problem (MDCP) is represented by a connected (di)graph G, a set of k depots that is a subset of the vertices of G, and a...

Persistent link: https://www.econbiz.de/10013088121

On the Core of Routing Games

Derks, Jean; Kuipers, Jeroen - 1997

A repairman makes a round-trip along a set of customers. He starts in his home location, visits each customer exactly once, and returns home. The cost of his trip has to be shared by the customers. A cooperative cost game, called routing game, is associated with this allocation problem, and an...

Persistent link: https://www.econbiz.de/10014060694

On the Core of Routing Games with Revenues

Estévez-Fernández, Arantza; Borm, Peter; Meertens, Marc; … - 2006

Traveling salesman problems with revenues form a generalization of traveling salesman problems. Here, next to travel costs an explicit revenue is generated by visiting a city. We analyze routing problems with revenues, where a predetermined route on all cities determines the tours along...

Persistent link: https://www.econbiz.de/10014057889