Timed network games
From MaRDI portal
Publication:5111251
Recommendations
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 177509 (Why is no real title available?)
- scientific article; zbMATH DE number 1794367 (Why is no real title available?)
- scientific article; zbMATH DE number 6783389 (Why is no real title available?)
- A class of games possessing pure-strategy Nash equilibria
- A theory of timed automata
- Algorithms – ESA 2005
- Algorithms, games, and the internet
- Alternating-time temporal logic
- An abstraction-refinement methodology for reasoning about network games
- Competitive routing over time
- Computer Science Logic
- Contention issues in congestion games
- Dynamic resource allocation games
- Exact price of anarchy for polynomial congestion games
- Games with secure equilibria
- Hierarchical network formation games
- How bad is selfish routing?
- How easy is local search?
- Nash Equilibrium for Upward-Closed Objectives
- Nash equilibria and the price of anarchy for flows over time
- Network-formation games with regular objectives
- On the impact of combinatorial structure on congestion games
- On the optimal reachability problem of weighted timed automata
- Optimal paths in weighted timed automata
- Random order congestion games
- Rational synthesis
- Repairing multi-player games
- Simple Local Search Problems that are Hard to Solve
- Strategy Logic
- Subgame perfection for equilibria in quantitative reachability games
- The Price of Stability for Network Design with Fair Cost Allocation
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- What good are digital clocks?
- Worst-case equilibria
Cited in
(12)- Contention issues in congestion games
- Timed network games with clocks
- Formal Modeling and Analysis of Timed Systems
- An abstraction-refinement methodology for reasoning about network games
- Non-blind strategies in timed network congestion games
- Infinite-duration bidding games
- Timed network games
- Computing the price of anarchy in atomic network congestion games (invited talk)
- Timing matters: online dynamics in broadcast games
- Dynamic resource allocation games
- Development of an idempotent algorithm for a network-delay game
- Algorithms and Computation
This page was built for publication: Timed network games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111251)
