The path player game

A publication (journal article) of the University of Göttingen

Jump to: Cite & Linked | Documents & Media | Details | Version history

Cite this publication

​Puerto, Justo, Anita Schoebel, and Silvia Schwarze. "The path player game​." ​Mathematical Methods of Operations Research, vol. 68, no. 1, ​2008, pp. 1​-20​, ​doi: 10.1007/s00186-007-0188-3. 

Documents & Media

License

Author's Version

Special user license Goescholar License

Details

Authors
Puerto, Justo
Schoebel, Anita
Schwarze, Silvia
Abstract
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.
Issue Date
2008
Status
published
Type
Journal Article
Publisher
Springer
Journal
Mathematical Methods of Operations Research 
ISSN
1432-5217; 1432-2994

Reference

Citations


Social Media