The path player game
- 86 Downloads
We introduce the path player game, a noncooperative network game with a continuum of mutually dependent set of strategies. This game models network flows from the point of view of competing network operators. The players are represented by paths in the network. They have to decide how much flow shall be routed along their paths. The competitive nature of the game is due to the following two aspects: First, a capacity bound on the overall network flow links the decisions of the players. Second, edges may be shared by several players which might have conflicting goals. In this paper, we prove the existence of feasible and pure-strategy equilibria in path player games, which is a nontrivial task due to noncontinuity of payoff functions and the infinite, mutually dependent strategy sets. We analyze different instances of path player games in more detail and present characterizations of equilibria for these cases.
KeywordsNetwork games Equilibria Path player games
Unable to display preview. Download preview PDF.
- 1.ARRIVAL: Algorithms for robust and online railway optimization: improving the validity and reliability of large scale systems. Funded by the “Future and Emerging Technologies” Unit of the EC within the 6th Framework Programme of the European Commission, http://arrival.cti.gr/.
- 2.Anshelevich E, Dasgupta A, Kleinberg J, Tardos É, Wexler T, Roughgarden T (2004) The price of stability for network design with fair cost allocation. In: Proceedings of FOCS04, pp 295–304Google Scholar
- 3.Archer A, Tardos É (2002) Frugal path mechanisms. In: Proceedings of the 13th Annual ACM-SIAM symposium on discrete algorithms, ACM, New York, pp 991–999Google Scholar
- 6.Czumaj A, Krysta P, Vöcking B (2002) Selfish traffic allocation for server farms. In: Proceedings of STOC02, pp 287–296Google Scholar
- 7.Devanur N, Garg N, Khandekar R, Pandit V, Saberi A, Vazirani VV (2005) Price of anarchy, locality gap, and a network service provider game. In: Proceedings of WINE05, pp 1046–1055Google Scholar
- 8.Elkind E, Sahai A, Steiglitz K (2004) Frugality in path auctions. In Proceedings of the 15th annual ACM-SIAM symposium on discrete algorithms. ACM, Newyork, pp 701–709Google Scholar
- 9.Fabrikant A, Luthra A, Maneva E, Papadimitriou CH, Shenker S (2003) On a network creation game. In: Proceedings of the 22th annual symposium on Principles of distributed computing, pp 347–351Google Scholar
- 11.Fudenberg D and Tirole J (1991). Game theory. MIT Press, Cambridge Google Scholar
- 21.Owen G (1995). Game theory. Academic, San Diego Google Scholar
- 22.Puerto J, Schöbel A, Schwarze S (2006) A class of infinite potential games. Technical Report 2006-15. Institut für Numerische und Angewandte Mathematik, Universität Göttingen (Preprint Reihe)Google Scholar
- 23.Puerto J, Schöbel A, Schwarze S Games on polyhedra. Working paperGoogle Scholar
- 24.Roughgarden T (2005). Selfish routing and the price of anarchy. MIT Press, Cambridge Google Scholar
- 25.Schöbel A (2006). Customer-Oriented optimization in public transportation. Springer, New York Google Scholar
- 26.Schöbel A, Schwarze S (2006a) A game-theoretic approach to line planning. In: Proceedings of ATMOS06, Zurich. http://drops.dagstuhl.de/opus/volltexte/2006/688
- 27.Schöbel A, Schwarze S (2006b) Dominance and equilibria in the path player game. In: Proceedings of OR2005, pp 489–494Google Scholar
- 28.Schwarze S (2006) Path Player Games: Analysis, generalization and application. PhD Thesis, University of GöttingenGoogle Scholar
- 29.Vetta A (2002) Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: Proceedings of FOCS02, pp 416–425Google Scholar