Timed network games
From MaRDI portal
Publication:2112796
DOI10.1016/j.ic.2022.104996OpenAlexW4310790831MaRDI QIDQ2112796
Guy Avni, Orna Kupferman, Shibashis Guha
Publication date: 12 January 2023
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2022.104996
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combined task- and network-level scheduling for distributed time-triggered systems
- Network-formation games with regular objectives
- Worst-case equilibria
- Optimal paths in weighted timed automata
- Nash equilibria and the price of anarchy for flows over time
- The algorithmic analysis of hybrid systems
- Competitive routing over time
- Games with secure equilibria
- How easy is local search?
- The temporal semantics of concurrent programs
- A theory of timed automata
- Is your model checker on time? On the complexity of model checking for timed modal logics
- On the optimal reachability problem of weighted timed automata
- A class of games possessing pure-strategy Nash equilibria
- Dynamic Resource Allocation Games
- A Faster Algorithm for Solving One-Clock Priced Timed Games
- Patrolling Games
- Subgame Perfection for Equilibria in Quantitative Reachability Games
- Energy and mean-payoff timed games
- Exact Price of Anarchy for Polynomial Congestion Games
- Contention Issues in Congestion Games
- Random Order Congestion Games
- Adding Negative Prices to Priced Timed Games
- How bad is selfish routing?
- Simple Local Search Problems that are Hard to Solve
- Hierarchical Network Formation Games
- The Price of Stability for Network Design with Fair Cost Allocation
- On the impact of combinatorial structure on congestion games
- Alternating-time temporal logic
- Strategy Logic
- Rational Synthesis
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- Nash Equilibrium for Upward-Closed Objectives
- Algorithms, games, and the internet
- Infinite-duration Bidding Games
- Computer Science Logic
- CONCUR 2004 - Concurrency Theory
- Reachability in Two-Clock Timed Automata Is PSPACE-Complete
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Automata, Languages and Programming
- Algorithms – ESA 2005
- Equilibrium points in n -person games
- Timed Parity Games: Complexity and Robustness
