Timed network games with clocks

Guy Avni, Shibashis Guha, Orna Kupferman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations


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 [13], 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 [13] and we develop new techniques in order to show that positive results on classic network games carry over to the stronger timed setting.

Original languageAmerican English
Title of host publication43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018
EditorsIgor Potapov, James Worrell, Paul Spirakis
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Print)9783959770866
StatePublished - 1 Aug 2018
Event43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 - Liverpool, United Kingdom
Duration: 27 Aug 201831 Aug 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018
Country/TerritoryUnited Kingdom

Bibliographical note

Publisher Copyright:
© Guy Avni, Shibashis Guha, and Orna Kupferman.


  • Equilibrium inefficiency
  • Nash equilibrium
  • Network games
  • Timed automata


Dive into the research topics of 'Timed network games with clocks'. Together they form a unique fingerprint.

Cite this