Network games are widely used as a model for selfish resource-allocation problems. In the classical model, each player selects a path connecting her source and target vertices. The cost of traversing an edge depends on the load; namely, number of players that traverse it. Thus, it abstracts the fact that different users may use a resource at different times and for different durations, which plays an important role in determining the costs of the users in reality. For example, when transmitting packets in a communication network, routing traffic in a road network, or processing a task in a production system, actual sharing and congestion of resources crucially depends on time. In , we introduced timed network games, which add a time component to network games. Each vertex v in the network is associated with a cost function, mapping the load on v to the price that a player pays for staying in v for one time unit with this load. Each edge in the network is guarded by the time intervals in which it can be traversed, which forces the players to spend time in the vertices. In this work we significantly extend the way time can be referred to in timed network games. In the model we study, the network is equipped with clocks, and, as in timed automata, edges are guarded by constraints on the values of the clocks, and their traversal may involve a reset of some clocks. We argue that the stronger model captures many realistic networks. The addition of clocks breaks the techniques we developed in  and we develop new techniques in order to show that positive results on classic network games carry over to the stronger timed setting.
|Original language||American English|
|Title of host publication||43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018|
|Editors||Igor Potapov, James Worrell, Paul Spirakis|
|Publisher||Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing|
|State||Published - 1 Aug 2018|
|Event||43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 - Liverpool, United Kingdom|
Duration: 27 Aug 2018 → 31 Aug 2018
|Name||Leibniz International Proceedings in Informatics, LIPIcs|
|Conference||43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018|
|Period||27/08/18 → 31/08/18|
Bibliographical noteFunding Information:
Supported by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M2369-N33 (Meitner fellowship). 2 Supported partially by the ARC project “Non-Zero Sum Game Graphs: Applications to Reactive Synthesis and Beyond” (Fédération Wallonie-Bruxelles). 3 Supported by the European Research Council (FP7/2007-2013) / ERC grant agreement no 278410.
© Guy Avni, Shibashis Guha, and Orna Kupferman.
- Equilibrium inefficiency
- Nash equilibrium
- Network games
- Timed automata